Numerical solution of linear eigenvalue problems
DOI10.1090/conm/700/14185zbMath1385.65029OpenAlexW4249862984MaRDI QIDQ4608452
Publication date: 16 March 2018
Published in: Geometric and Computational Spectral Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7414f9e6d162b8aea60f68e96cbaaa5fbd6622c6
eigenvaluestridiagonal matricesJacobi-Davidson methodpower methodQR iterationeigenpairlarge and sparse matricesdivide-and-conquer algorithmsLanczos and Arnoldi methodsKrylov subspace eigensolversorthogonal iterations
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- A note on the double-shift \(QL\) algorithm
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- A multishift QR iteration without computation of the shifts
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- Preconditioning techniques for large linear systems: A survey
- The transmission of shifts and shift blurring in the QR algorithm
- Numerical methods for general and structured eigenvalue problems.
- The QR algorithm for real Hessenberg matrices
- Zur quadratischen Konvergenz des Jacobi-Verfahrens.(On quadrative convergence of the Jacobi method)
- On the quadratic convergence of the special cyclic Jacobi method
- Das Iterationsverfahren bei nicht selbstadjungierten linearen Eigenwertaufgaben
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Numerical Computing with IEEE Floating Point Arithmetic
- Matrix Algorithms
- Francis’s Algorithm
- Numerical Methods for Large Eigenvalue Problems
- Understanding the $QR$ Algorithm
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- Numerical methods for large eigenvalue problems
- Numerical solution of saddle point problems
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- Jacobi’s Method is More Accurate than QR
- The Lanczos Algorithm with Selective Orthogonalization
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
- The Davidson Method
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- Accuracy and Stability of Numerical Algorithms
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Preconditioning
- The Matrix Eigenvalue Problem
- The QR Algorithm Revisited
- Estimates for Some Computational Techniques in Linear Algebra
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection
This page was built for publication: Numerical solution of linear eigenvalue problems
