Improving the Accuracy of Inverse Iteration

DOI10.1137/0913031zbMath0758.65032OpenAlexW2089764547MaRDI QIDQ3991051

E. R. Jessup, Ilse C. F. Ipsen

Publication date: 28 June 1992

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0913031

zbMATH Keywords

numerical experimentseigenvectorsinverse iterationQL methodreal symmetric tridiagonal matrixdivide-and-conquer methodsaccuracy improvementEISPACK routine TINVIT

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

On computing accurate singular values and eigenvalues of matrices with acyclic graphs ⋮ Probabilistic Bounds for the Matrix Condition Number with Extended Lanczos Bidiagonalization ⋮ Fernando's solution to Wilkinson's problem: An application of double factorization ⋮ Inverse iteration method with multiple cyclotomically shifted parameters ⋮ Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces ⋮ A case against a divide and conquer approach to the nonsymmetric eigenvalue problem ⋮ Approximate Calculation of Sums II: Gaussian Type Quadrature ⋮ Current inverse iteration software can fail ⋮ The orthogonal Rayleigh quotient iteration (ORQI) method

Uses Software

• LAPACK
• EISPACK

This page was built for publication: Improving the Accuracy of Inverse Iteration