Lanczos tridiagonalization of a symmetric matrix
(0.003 seconds)
11—20 of 895 matching pages
11: 3.5 Quadrature
…
►with a function that is analytic in a strip containing .
…
►where .
…
►The monic and orthonormal recursion relations of this section are both closely related to the Lanczos recursion relation in §3.2(vi).
►The Gauss nodes (the zeros of ) are the eigenvalues of the (symmetric tridiagonal) Jacobi matrix of order :
…
►a complex Gauss quadrature formula is available.
…
12: 35.2 Laplace Transform
§35.2 Laplace Transform
►Definition
►For any complex symmetric matrix , … ►Inversion Formula
… ►Convolution Theorem
…13: Bibliography S
…
►
The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions.
2nd edition, Graduate Texts in Mathematics, Vol. 203, Springer-Verlag, New York.
…
►
Time propagation of partial differential equations using the short iterative Lanczos method and finite-element discrete variable representation.
Adv. Quantum Chem. 72, pp. 95–127.
…
►
Some combinatorial properties of Jack symmetric functions.
Adv. Math. 77 (1), pp. 76–115.
…
►
A Maple package for symmetric functions.
J. Symbolic Comput. 20 (5-6), pp. 755–768.
…
►
Matrix Algorithms. Vol. 2: Eigensystems.
Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.
…
14: 29.20 Methods of Computation
…
►A second approach is to solve the continued-fraction equations typified by (29.3.10) by Newton’s rule or other iterative methods; see §3.8.
…(Equation (29.6.3) serves as a check.)
…
►A third method is to approximate eigenvalues and Fourier coefficients of Lamé functions by eigenvalues and eigenvectors of finite matrices using the methods of §§3.2(vi) and 3.8(iv).
…
►A fourth method is by asymptotic approximations by zeros of orthogonal polynomials of increasing degree.
…
►The eigenvalues corresponding to Lamé polynomials are computed from eigenvalues of the finite tridiagonal matrices given in §29.15(i), using methods described in §3.2(vi) and Ritter (1998).
…
15: 3.7 Ordinary Differential Equations
…
►where is the matrix
…
►Let be the band matrix
…
►If, for example, , then on moving the contributions of and to the right-hand side of (3.7.13) the resulting system of equations is not tridiagonal, but can readily be made tridiagonal by annihilating the elements of that lie below the main diagonal and its two adjacent diagonals.
…
►Let be a finite or infinite interval and be a real-valued continuous (or piecewise continuous) function on the closure of .
…
►This converts the problem into a tridiagonal matrix problem in which the elements of the matrix are polynomials in ; compare §3.2(vi).
…
16: 18.39 Applications in the Physical Sciences
…
►defines the potential for a symmetric restoring force for displacements from .
…
►The technique to accomplish this follows the DVR idea, in which methods are based on finding tridiagonal representations of the co-ordinate, .
Here tridiagonal representations of simple Schrödinger operators play a similar role.
…is tridiagonalized in the complete non-orthogonal (with measure , ) basis of Laguerre functions:
…
►While in the basis of (18.39.44) is simply a variational parameter, care must be taken, or the relationship between the results of the matrix variational approximation and the Pollaczek polynomials is lost, although this has no effect on the use of the variational approximations Reinhardt (2021a, b).
…
17: 21.5 Modular Transformations
…
►is a symplectic matrix, that is,
…
►( invertible with integer elements.)
…(
symmetric with integer elements and even diagonal elements.)
…(
symmetric with integer elements.)
…For a
matrix
we define , as a column vector with the diagonal entries as elements.
…
18: 35.4 Partitions and Zonal Polynomials
…
►A partition
is a vector of nonnegative integers, listed in nonincreasing order.
Also, denotes , the weight of ; denotes the number of nonzero ; denotes the vector .
…
►where .
…
►Therefore is a symmetric polynomial in the eigenvalues of .
…
►For and ,
…
19: 21.1 Special Notation
…
►
►
…
positive integers. | |
… | |
complex, symmetric matrix with strictly positive definite, i.e., a Riemann matrix. | |
… | |
th element of vector . | |
th element of matrix . | |
… | |
zero matrix. | |
identity matrix. | |
… |