Improving the Accuracy of Computed Eigenvalues and Eigenvectors
From MaRDI portal
Publication:3673937
DOI10.1137/0720002zbMATH Open0523.65021OpenAlexW1975721804MaRDI QIDQ3673937FDOQ3673937
Authors: Cleve B. Moler, J. H. Wilkinsons, Jack 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/
Cited In (27)
- On estimating the condition of eigenvalues and eigenvectors
- The calculation of guaranteed bounds for eigenvalues using complementary variational principles
- Verified error bounds for eigenvalues of geometric multiplicity \(q\) and corresponding invariant subspaces
- Mixed precision algorithms in numerical linear algebra
- Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
- Inexact inverse iteration for symmetric matrices
- An eigenvalue search method using the Orr-Sommerfeld equation for shear flow
- Linear algebra software for large-scale accelerated multicore computing
- Projected nonsymmetric algebraic Riccati equations and refining estimates of invariant and deflating subspaces
- Three methods for refining estimates of invariant subspaces
- A refinement of approximate invariant subspaces of matrices based on SVD in high dimensionality reduction and image compression
- Computational error bounds for multiple or nearly multiple eigenvalues
- Two-sided Grassmann-Rayleigh quotient iteration
- Iterative improvement of componentwise error bounds of invariant subspaces belonging to a double or nearly double eigenvalue
- Iterative refinement for symmetric eigenvalue decomposition
- Inverse, Shifted Inverse, and Rayleigh Quotient Iteration as Newton's Method
- A simple method for error bounds of eigenvalues of symmetric matrices
- Iterative refinement for an eigenpair subset of a real symmetric matrix
- Accelerating scientific computations with mixed precision algorithms
- Small-sample statistical condition estimation of large-scale generalized eigenvalue problems
- Iterative refinement for defective subspaces of differential operators
- Iterative diagonalization of symmetric matrices in mixed precision and its application to electronic structure calculations
- On conjugate gradient-like methods for eigen-like problems
- Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils
- Matrix-less spectral approximation for large structured matrices
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- Title not available (Why is that?)
Uses Software
This page was built for publication: Improving the Accuracy of Computed Eigenvalues and Eigenvectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673937)
