| B. N. Parlett, The symmetric eigenvalue problem, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1998. |
....multiplications) but in general are more expensive to construct (they require inner products and, in general, require more memory) This dichotomy is similar to the one known for iterative methods for linear systems, e.g. 29, Section 2.2] 4. 1 Lanczos approximations The Lanczos method (e.g. [30,31]) exploits a three term recurrence for the construction of an orthonormal basis v 1 , v k 1 for the subspace K k 1 (A; b) as de ned in Section 2. This algorithm is given in Alg. 1. The Lanczos algorithm can be expressed in matrix form as AV k = V k T k k v k 1 e k = V k T k (10) ....
B.N. Parlett, The Symmetric Eigenvalue Problem (Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1998.
....of applying hyperbolic rotations to a vector or a matrix in a mixed way is illustrated in section 6.1. Unified rotations can be used for reducing C #J to tridiagonal diagonal form in a way similar to how Givens rotations are used to tridiagonalize a symmetric matrix (Givens method) 10] [19]. Assume that at the beginning of step j the matrix C = c ij ) is tridiagonal as far as its first j rows and columns are concerned. At the jth step, we introduce zeros in the matrix C in positions (i, j) and (j, i) j 2 using n 1 unified rotations. The zeroing operations can be ....
Beresford N. Parlett, The Symmetric Eigenvalue Problem, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1998.
No context found.
B.N. Parlett, The Symmetric Eigenvalue Problem, Society for Industrial and Applied Mathematics, Phiadelphia, PA, USA, 1998.
No context found.
B. N. Parlett, The Symmetric Eigenvalue Problem, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA,
....is to compute p(#) p n (#) and its derivative by using the recurrence p 0 (#) 1, p k (#) # k ## k )p k 1 (#) # k 1 # k 1 p k 2 (#) k = 2: n, 2.2) obtained by expanding det(T k #I k ) by its last row. Since this recurrence is known to su#er from overflow and underflow problems [23], we adopt a di#erent strategy. Assume that # is not a zero of p, that is, p(#) 0. Then trace # i , 2.3) where # i is the ith diagonal element of (T . In what follows, S denotes the shifted tridiagonal matrix S : T #I. If S is unreduced, S can be ....
B. N. Parlett, The Symmetric Eigenvalue Problem, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA,
No context found.
Beresford N. Parlett. The Symmetric Eigenvalue Problem. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1998.
No context found.
B. N. Parlett, The symmetric eigenvalue problem, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1998.
No context found.
Beresford N. Parlett. The Symmetric Eigenvalue Problem. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1998.
No context found.
Beresford N. Parlett, The Symmetric Eigenvalue Problem, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1998.
No context found.
Beresford N. Parlett. The Symmetric Eigenvalue Problem. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1998.
No context found.
Beresford N. Parlett. The Symmetric Eigenvalue Problem. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC