TOPICS
Search

Search Results for ""


2801 - 2810 of 3638 for Ordinary Differential Equation Systemwit...Search Results
Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...
A generating function f(x) is a formal power series f(x)=sum_(n=0)^inftya_nx^n (1) whose coefficients give the sequence {a_0,a_1,...}. The Wolfram Language command ...
The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named ...
The hypercube is a generalization of a 3-cube to n dimensions, also called an n-cube or measure polytope. It is a regular polytope with mutually perpendicular sides, and is ...
The second knot polynomial discovered. Unlike the first-discovered Alexander polynomial, the Jones polynomial can sometimes distinguish handedness (as can its more powerful ...
A pairing function is a function that reversibly maps Z^*×Z^* onto Z^*, where Z^*={0,1,2,...} denotes nonnegative integers. Pairing functions arise naturally in the ...
Abstract Algebra
Legendre showed that there is no rational algebraic function which always gives primes. In 1752, Goldbach showed that no polynomial with integer coefficients can give a prime ...
Apéry's numbers are defined by A_n = sum_(k=0)^(n)(n; k)^2(n+k; k)^2 (1) = sum_(k=0)^(n)([(n+k)!]^2)/((k!)^4[(n-k)!]^2) (2) = _4F_3(-n,-n,n+1,n+1;1,1,1;1), (3) where (n; k) ...
The characteristic polynomial is the polynomial left-hand side of the characteristic equation det(A-lambdaI)=0, (1) where A is a square matrix and I is the identity matrix of ...
1 ... 278|279|280|281|282|283|284 ... 364 Previous Next

...