Search Results for ""

The conjugate gradient method can be viewed as a special variant of the Lanczos method for positive definite symmetric systems. The minimal residual method and symmetric LQ ...

A quantity such as a polynomial discriminant which remains unchanged under a given class of algebraic transformations. Such invariants were originally called ...

E. Pegg Jr. (pers. comm., Nov. 8, 2004) found an approximation to Apéry's constant zeta(3) given by zeta(3) approx 10+zeta(16)-sqrt(96), (1) which is good to 6 digits. M. ...

Given a regular surface M, an asymptotic curve is formally defined as a curve x(t) on M such that the normal curvature is 0 in the direction x^'(t) for all t in the domain of ...

A 1-variable unoriented knot polynomial Q(x). It satisfies Q_(unknot)=1 (1) and the skein relationship Q_(L_+)+Q_(L_-)=x(Q_(L_0)+Q_(L_infty)). (2) It also satisfies ...

The Baum-Sweet sequence is the sequence of numbers {b_n} such that b_n=1 if the binary representation of n contains no block of consecutive 0s of odd length, and b_n=0 ...

Binet's formula is an equation which gives the nth Fibonacci number as a difference of positive and negative nth powers of the golden ratio phi. It can be written as F_n = ...

A fractal which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 1 0; 1 1 1; 0 1 0],1->[1 1 1; 1 1 1; 1 1 1]}. (1) The size ...

Clark's triangle is a number triangle created by setting the vertex equal to 0, filling one diagonal with 1s, the other diagonal with multiples of an integer f, and filling ...

Consider a combination lock consisting of n buttons that can be pressed in any combination (including multiple buttons at once), but in such a way that each number is pressed ...