Numerical solution of linear eigenvalue problems

DOI10.1090/CONM/700/14185MaRDI QIDQ4608452zbMATH OpenOpenAlexFDO

Authors Jessica Bosch, Chen Greif

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

zbMATH Keywords

eigenvaluestridiagonal matricesJacobi-Davidson methodpower methodeigenpairQR iterationlarge and sparse matricesdivide-and-conquer algorithmsLanczos and Arnoldi methodsKrylov subspace eigensolversorthogonal iterations

Mathematics Subject Classification ID

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

Recommendations

• Computational methods for large eigenvalue problems
• Some Perspectives on the Eigenvalue Problem
• Numerical methods for large eigenvalue problems
• Numerical methods for eigenvalue problems.
• Modern methods for the iterative computation of eigenpairs of matrices of high dimension

Cites work

• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 88927 (Why is no real title available?)
• scientific article; zbMATH DE number 192975 (Why is no real title available?)
• scientific article; zbMATH DE number 3473182 (Why is no real title available?)
• scientific article; zbMATH DE number 1049347 (Why is no real title available?)
• scientific article; zbMATH DE number 1049350 (Why is no real title available?)
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 2221749 (Why is no real title available?)
• scientific article; zbMATH DE number 3199190 (Why is no real title available?)
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• A Look-Ahead Lanczos Algorithm for Unsymmetric 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
• A note on the double-shift \(QL\) algorithm
• A survey of preconditioned iterative methods for linear systems of algebraic equations
• Accuracy and Stability of Numerical Algorithms
• An implicit restarted Lanczos method for large symmetric eigenvalue problems
• Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
• Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• Das Iterationsverfahren bei nicht selbstadjungierten linearen Eigenwertaufgaben
• Estimates for Some Computational Techniques in Linear Algebra
• Francis’s Algorithm
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Jacobi’s Method is More Accurate than QR
• Matrix algorithms. Vol. 2: Eigensystems
• Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
• Numerical computing with IEEE floating point arithmetic. Incl. one theorem, one rule of thumb, and one hundred and one exercises
• Numerical methods for general and structured eigenvalue problems.
• Numerical methods for large eigenvalue problems
• Numerical methods for large eigenvalue problems
• Numerical solution of saddle point problems
• On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
• On the quadratic convergence of the special cyclic Jacobi method
• Preconditioning
• Preconditioning techniques for large linear systems: A survey
• The QR Algorithm Revisited
• The Davidson Method
• The Lanczos Algorithm with Selective Orthogonalization
• The Matrix Eigenvalue Problem
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• The QR algorithm for real Hessenberg matrices
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• The transmission of shifts and shift blurring in the QR algorithm
• Thick-restart Lanczos method for large symmetric eigenvalue problems
• Understanding the QR Algorithm
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• Zur quadratischen Konvergenz des Jacobi-Verfahrens.(On quadrative convergence of the Jacobi method)

Cited in

(8)

• A stable, polynomial-time algorithm for the eigenpair problem
• Numerical methods for eigenvalue problems.
• Eigenvalue computation in the 20th century
• Numerical computations for long-wave short-wave interaction equations in semi-classical limit
• Numerical solution of a quadratic eigenvalue problem
• Linear multiparameter eigenvalue spectral problem and numerical method of its solution
• scientific article; zbMATH DE number 3886986 (Why is no real title available?)
• Modern methods for the iterative computation of eigenpairs of matrices of high dimension

Describes a project that uses

Uses Software

• IRAM
• JDQZ
• mctoolbox
• TRLan

This page was built for publication: Numerical solution of linear eigenvalue problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608452)