Search Results for ""

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.

A distinct (including reflections and rotations) arrangement of adjacent squares on a grid, also called a fixed polyomino.

The Lebesgue identity is the algebraic identity (Nagell 1951, pp. 194-195).

A lens space L(p,q) is the 3-manifold obtained by gluing the boundaries of two solid tori together such that the meridian of the first goes to a (p,q)-curve on the second, ...

A linear functional on a real vector space V is a function T:V->R, which satisfies the following properties. 1. T(v+w)=T(v)+T(w), and 2. T(alphav)=alphaT(v). When V is a ...

A subset M of a Hilbert space H is a linear manifold if it is closed under addition of vectors and scalar multiplication.

A Lorentz tensor is any quantity which transforms like a tensor under the homogeneous Lorentz transformation.

Let the least term h of a sequence be a term which is smaller than all but a finite number of the terms which are equal to h. Then h is called the lower limit of the ...

A triangular matrix L of the form L_(ij)={a_(ij) for i>=j; 0 for i<j. (1) Written explicitly, L=[a_(11) 0 ... 0; a_(21) a_(22) ... 0; | | ... 0; a_(n1) a_(n2) ... a_(nn)]. ...

The ordinary differential equation y^('')+r/zy^'=(Az^m+s/(z^2))y. (1) It has solution y=c_1I_(-nu)((2sqrt(A)z^(m/2+1))/(m+2))z^((1-r)/2) ...