\(QR\)-like algorithms for eigenvalue problems
From MaRDI portal
Publication:1591175
DOI10.1016/S0377-0427(00)00402-7zbMath0979.65027MaRDI QIDQ1591175
Publication date: 10 February 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
convergenceresearch surveyeigenvalue problemsreduction of dimension\(QR\) algorithm\(GR\) algorithmbulge-chasing proceduresshift strategies
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02)
Related Items
The LR Cholesky algorithm for symmetric hierarchical matrices, A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence, Parallel solution of large-scale eigenvalue problem for master equation in protein folding dynamics, Unstructured quotient fixed modes and decentralised stabilisability, Electron energy level calculations for cylindrical narrow gap semiconductor quantum dot, Computer simulation of electron energy levels for different shape InAs/GaAs semiconductor quantum dots, An extended QR-solver for large profiled matrices, An iterative method for single and vertically stacked semiconductor quantum dots simulation
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
- Unnamed Item
- A parallel implementation of the QR-algorithm
- Convergence of algorithms of decomposition type for the eigenvalue problem
- The computation of Kronecker's canonical form of a singular pencil
- A Schur decomposition for Hamiltonian matrices
- Kronecker's canonical form and the QZ algorithm
- An analysis of the HR algorithm for computing the eigenvalues of a matrix
- Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process
- Schur parameter pencils for the solution of the unitary eigenproblem
- Numerical linear algorithms and group theory
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Accurate singular values and differential qd algorithms
- An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
- Two connections between the \(SR\) and \(HR\) eigenvalue algorithms
- The transmission of shifts and shift blurring in the QR algorithm
- Global convergence of tridiagonal QR algorithm with origin shifts
- Der Quotienten-Differenzen-Algorithmus
- The Multishift QR Algorithm. Part I: Maintaining Well-Focused Shifts and Level 3 Performance
- Understanding the $QR$ Algorithm
- Some Perspectives on the Eigenvalue Problem
- Systolic Networks for Orthogonal Decompositions
- Chasing Algorithms for the Eigenvalue Problem
- ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATION
- Rayleigh Quotient Iteration for Nonsymmetric Matrices
- A Hamiltonian $QR$ Algorithm
- An extended set of FORTRAN basic linear algebra subprograms
- Deferred Shifting Schemes for Parallel QR Methods
- The $LZ$-Algorithm to Solve the Generalized Eigenvalue Problem
- Bulge Exchanges in Algorithms of QR Type
- Theory of Decomposition and Bulge-Chasing Algorithms for the Generalized Eigenvalue Problem
- Shifting Strategies for the Parallel $QR$ Algorithm
- ScaLAPACK Users' Guide
- QR -like algorithms for the nonsymmetric eigenvalue problem
- A set of level 3 basic linear algebra subprograms
- The BR Eigenvalue Algorithm
- A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
- A Parallel Implementation of the Nonsymmetric QR Algorithm for Distributed Memory Architectures
- On some algorithms for the solution of the complete eigenvalue problem
- A Geometric Theory for the $QR$, $LU$ and Power Iterations
- An Algorithm for Generalized Matrix Eigenvalue Problems