Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations

DOI10.1016/S0024-3795(99)00204-9zbMath0948.65033MaRDI QIDQ1976920

Gene H. Golub, Zhenyue Zhang, Hongyuan Zha

Publication date: 13 November 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

numerical examplesextreme eigenvaluesinner-outer iteration algorithmslarge sparse eigenvalue problem

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

Computational Lower Bounds of the Maxwell Eigenvalues, A new justification of the Jacobi-Davidson method for large eigenproblems, Inexact inverse subspace iteration for generalized eigenvalue problems, Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems, Computing the smallest singular triplets of a large matrix, Updating component reduction bases of static and vibration modes using preconditioned iterative techniques, On expansion of search subspaces for large non-Hermitian eigenproblems, Continuous methods for symmetric generalized eigenvalue problems, Claculating interior eigenvalues and eigenvectors with an implicitly restarted and a filter diagonalization method, Relaxation strategies for nested Krylov methods, Inexact rational Krylov method for evolution equations, Adaptive finite element solution of eigenvalue problems: Balancing of discretization and iteration error, Preconditioned Lanczos method for generalized Toeplitz eigenvalue problems, Unnamed Item, A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems, A solution procedure for constrained eigenvalue problems and its application within the structural finite-element code NOSA-ITACA

Uses Software

• LSQR
• JDQZ
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A subspace preconditioning algorithm for eigenvector/eigenvalue computation
• The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems
• Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
• Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
• An implicit restarted Lanczos method for large symmetric eigenvalue problems
• Solution of sparse rectangular systems using LSQR and Craig
• Computing the generalized singular values/vectors of large sparse or structured matrix pairs
• Invariant subspaces for tightly clustered eigenvalues of tridiagonals
• Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
• The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Inexact Newton Methods
• Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
• Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
• Inner and Outer Iterations for the Chebyshev Algorithm
• Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems