Eigenvalue computation in the 20th century

DOI10.1016/S0377-0427(00)00413-1zbMath0965.65057WikidataQ56551264 ScholiaQ56551264MaRDI QIDQ1591174

Henk A. van der Vorst, Gene H. Golub

Publication date: 19 December 2000

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

singular value decompositionLanczos methodcanonical formshistorical surveynonlinear eigenvalue problemseigenvalue problemsJacobi methodpseudospectrapower methoditeration methodsreduction algorithmshomotopy methods

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) History of mathematics in the 20th century (01A60) History of numerical analysis (65-03)

Related Items

Age-structured social interactions enhance radicalization, Geometry of matrix decompositions seen through optimal transport and information geometry, An efficient and uniformly behaving streamline-based \(\mu\)CT fibre tracking algorithm using volume-wise structure tensor and signal processing techniques, Some remarks on the complex \(J\)-symmetric eigenproblem, A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method, Solving large-scale finite element nonlinear eigenvalue problems by resolvent sampling based Rayleigh-Ritz method, Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems, Spectral computation with third-order tensors using the t-product, Fictitious eigenfrequencies in the BEM for interior acoustic problems, Matrix Laplace transform, The expected characteristic and permanental polynomials of the random Gram matrix, A functional analytic approach to validated numerics for eigenvalues of delay equations, Interior point methods for solving Pareto eigenvalue complementarity problems, The inner structure of sensitivities in nodal based shape optimisation, A DC programming approach for solving the symmetric eigenvalue complementarity problem, A projection method for generalized eigenvalue problems using numerical integration., Computational prediction of mechanical hemolysis in aortic valved prostheses, Recent developments combining ensemble smoother and deep generative networks for facies history matching, Optimal quotients for solving large eigenvalue problems, Geometric Matrix Midranges, On the subspace projected approximate matrix method., Continuous methods for symmetric generalized eigenvalue problems, Tosio Kato's work on non-relativistic quantum mechanics. I, A projection method for the computation of inner eigenvalues using high degree rational operators, A new vector field method for eigen-decomposition of symmetric matrices, Global parametric solutions of scalar transport, On a progressive and iterative approximation method with memory for least square fitting, The WZ algorithm for the eigenvalue problem of complex matrix, A uniform object-oriented solution to the eigenvalue problem for real symmetric and Hermitian matrices, On convergence of iterative projection methods for symmetric eigenvalue problems, On the cone eigenvalue complementarity problem for higher-order tensors, Asymptotic and spectral analysis of the gyrokinetic-waterbag integro-differential operator in toroidal geometry, An approach for large-scale gyroscopic eigenvalue problems with application to high-frequency response of rolling tires, The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem, Development of powerful algorithm for maximal eigenpair, An extended QR-solver for large profiled matrices, Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization, Hyper-dual number-based numerical differentiation of eigensystems, The numerical Jordan form, Unnamed Item, Tosio Kato’s work on non-relativistic quantum mechanics, Part 2, A SEQUENTIAL SUBSPACE PROJECTION METHOD FOR LINEAR SYMMETRIC EIGENVALUE PROBLEM, The variational quantum eigensolver: a review of methods and best practices, The theory of variational hybrid quantum-classical algorithms

Uses Software

• QMRPACK
• ScaLAPACK
• SRRIT
• eigs
• JDQR
• ARPACK
• JDQZ
• IRAM
• ABLE
• DSUBSP

Cites Work

• Approximate solutions and eigenvalue bounds from Krylov subspaces
• Progress in the numerical solution of the nonsymmetric eigenvalue problem
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• On some algorithms for the solution of the complete eigenvalue problem
• Estimates for Some Computational Techniques in Linear Algebra
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• The Rotation of Eigenvectors by a Perturbation. III
• On Jacobi and Jacobi-Like Algorithms for a Parallel Computer
• On an Approach to the Solution of the Generalized Latent Value Problem for $\lambda $-Matrices
• An Algorithm for Generalized Matrix Eigenvalue Problems
• Algorithms for the Nonlinear Eigenvalue Problem
• Unitary Triangularization of a Nonsymmetric Matrix
• A Recurring Theorem on Determinants
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• The accuracy of Rayleigh’s method of calculating the natural frequencies of vibrating systems
• Computing Eigenvalues and Eigenvectors of a Symmetric Matrix on the ILLIAC
• A Method for Finding Roots of Arbitrary Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computation of Kronecker's canonical form of a singular pencil
• Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme
• Zur Konvergenz des Jacobi-Verfahrens
• Norms and exclusion theorems
• The generalized singular value decomposition and the general (A-\(\lambda\) B)-problem
• Computing interior eigenvalues of large matrices
• Iteration methods in eigenvalue problems
• The convergence behavior of Ritz values in the presence of close eigenvalues
• Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• Kronecker's canonical form and the QZ algorithm
• Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• On Szegö's eigenvalue distribution theorem and non-Hermitian kernels
• Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices
• Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
• Preconditioning eigensolvers -- an Oxymoron?
• Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
• A generalized nonsymmetric Lanczos procedure
• Spectral portrait for non-Hermitian large sparse matrices
• The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
• Numerical solutions for large sparse quadratic eigenvalue problems
• Homotopy method for the numerical solution of the eigenvalue problem of self-adjoint partial differential operators
• Computing the field of values and pseudospectra using the Lanczos method with continuation
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• Backward error and condition of polynomial eigenvalue problems
• Computational aspects of F. L. Bauer's simultaneous iteration method
• Solution to the complex eigenproblem by a norm reducing Jacobi type method
• An eigenvalue algorithm for skew-symmetric matrices
• On the quadratic convergence of the special cyclic Jacobi method
• A minimax theory for overdamped systems
• Hydrodynamic Stability Without Eigenvalues
• The Restarted Arnoldi Method Applied to Iterative Linear System Solvers for the Computation of Rightmost Eigenvalues
• Some Perspectives on the Eigenvalue Problem
• The Jacobi Method for Real Symmetric Matrices
• On the Speed of Convergence of Cyclic and Quasicyclic Jacobi Methods for Computing Eigenvalues of Hermitian Matrices
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• Chasing Algorithms for the Eigenvalue Problem
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
• RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular $A - \lambda B$ Pencils
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• An Instability Phenomenon in Spectral Methods
• Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
• On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
• The generalized eigenstructure problem in linear system theory
• A Generalized Eigenvalue Approach for Solving Riccati Equations
• Tracking the Progress of the Lanczos Algorithm for Large Symmetric Eigenproblems
• Algorithm 590: DSUBSP and EXCHQZ  : FORTRAN Subroutines for Computing Deflating Subspaces with Specified Spectrum
• 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
• Homotopy-Determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems
• Solution of Sparse Indefinite Systems of Linear Equations
• Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
• A New Proof of Global Convergence for the Tridiagonal $QL$ Algorithm
• The Lanczos Algorithm with Selective Orthogonalization
• Numerical Linear Algebra for High-Performance Computers
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• Algorithm 776: SRRIT
• On the Early History of the Singular Value Decomposition
• The Davidson Method
• A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
• Computation of Pseudospectra by Continuation
• Homotopy Method for the Large, Sparse, Real Nonsymmetric Eigenvalue Problem
• ScaLAPACK Users' Guide
• QMRPACK
• ARPACK Users' Guide
• On the Homotopy Method for Perturbed Symmetric Generalized Eigenvalue Problems
• ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
• A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures
• Singular Value Analysis of Cryptograms
• A Practical Upper Bound for Departure from Normality
• Software Libraries for Linear Algebra Computations on High Performance Computers