Search Results for ""

Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...

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

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 ...

If x_0 is an ordinary point of the ordinary differential equation, expand y in a Taylor series about x_0. Commonly, the expansion point can be taken as x_0=0, resulting in ...

Two matrices A and B are said to be equal iff a_(ij)=b_(ij) (1) for all i,j. Therefore, [1 2; 3 4]=[1 2; 3 4], (2) while [1 2; 3 4]!=[0 2; 3 4]. (3)

If p is prime, then p|P(p), where P(p) is a member of the Perrin sequence 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, ... (OEIS A001608). A Perrin pseudoprime is a composite number n ...

Krall and Fink (1949) defined the Bessel polynomials as the function y_n(x) = sum_(k=0)^(n)((n+k)!)/((n-k)!k!)(x/2)^k (1) = sqrt(2/(pix))e^(1/x)K_(-n-1/2)(1/x), (2) where ...

The golden ratio phi can be written in terms of a nested radical in the beautiful form phi=sqrt(1+sqrt(1+sqrt(1+sqrt(1+...)))), (1) which can be written recursively as ...

The recursive sequence defined by the recurrence relation a(n)=a(a(n-1))+a(n-a(n-1)) (1) with a(1)=a(2)=1. The first few values are 1, 1, 2, 2, 3, 4, 4, 4, 5, 6, ... (OEIS ...

A function S_n(z) which satisfies the recurrence relation S_(n-1)(z)-S_(n+1)(z)=2S_n^'(z) together with S_1(z)=-S_0^'(z) is called a hemicylindrical function.