Search Results for ""

A generalization of the equation whose solution is desired in Fermat's last theorem x^n+y^n=z^n to x^n+y^n=cz^n for x, y, z, and c positive constants, with trivial solutions ...

A root-finding algorithm which makes use of a third-order Taylor series f(x)=f(x_n)+f^'(x_n)(x-x_n)+1/2f^('')(x_n)(x-x_n)^2+.... (1) A root of f(x) satisfies f(x)=0, so 0 ...

The second-order ordinary differential equation (d^2y)/(dx^2)+[theta_0+2sum_(n=1)^inftytheta_ncos(2nx)]y=0, (1) where theta_n are fixed constants. A general solution can be ...

A generalization of the Fibonacci numbers defined by the four constants (p,q,r,s) and the definitions H_0=p and H_1=q together with the linear recurrence equation ...

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...

The Jordan canonical form, also called the classical canonical form, of a special type of block matrix in which each block consists of Jordan blocks with possibly differing ...

Given a series of positive terms u_i and a sequence of finite positive constants a_i, let rho=lim_(n->infty)(a_n(u_n)/(u_(n+1))-a_(n+1)). 1. If rho>0, the series converges. ...

There exist lattices in n dimensions having hypersphere packing densities satisfying eta>=(zeta(n))/(2^(n-1)), where zeta(n) is the Riemann zeta function. However, the proof ...

Müntz's theorem is a generalization of the Weierstrass approximation theorem, which states that any continuous function on a closed and bounded interval can be uniformly ...