Improving the Accuracy of Computed Eigenvalues and Eigenvectors
From MaRDI portal
Publication:3673937
DOI10.1137/0720002zbMath0523.65021OpenAlexW1975721804MaRDI QIDQ3673937
Cleve Moler, J. H. Wilkinsons, Jack J. Dongarra
Publication date: 1983
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc283505/
Related Items
Three methods for refining estimates of invariant subspaces, Mixed precision algorithms in numerical linear algebra, Iterative refinement for symmetric eigenvalue decomposition, On estimating the condition of eigenvalues and eigenvectors, Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem, Robust preconditioning of large, sparse, symmetric eigenvalue problems, On conjugate gradient-like methods for eigen-like problems, An eigenvalue search method using the Orr-Sommerfeld equation for shear flow, Iterative diagonalization of symmetric matrices in mixed precision and its application to electronic structure calculations, Small-sample statistical condition estimation of large-scale generalized eigenvalue problems, Iterative refinement for defective subspaces of differential operators, Unnamed Item, Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils, The calculation of guaranteed bounds for eigenvalues using complementary variational principles, Verified error bounds for eigenvalues of geometric multiplicity \(q\) and corresponding invariant subspaces, Computational error bounds for multiple or nearly multiple eigenvalues, Linear algebra software for large-scale accelerated multicore computing, A simple method for error bounds of eigenvalues of symmetric matrices, Two-sided Grassmann-Rayleigh quotient iteration, Accelerating scientific computations with mixed precision algorithms, Inexact inverse iteration for symmetric matrices, Projected nonsymmetric algebraic Riccati equations and refining estimates of invariant and deflating subspaces, Inverse, Shifted Inverse, and Rayleigh Quotient Iteration as Newton's Method, Iterative improvement of componentwise error bounds of invariant subspaces belonging to a double or nearly double eigenvalue
Uses Software
