Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
From MaRDI portal
Publication:1067356
DOI10.1016/0024-3795(84)90025-9zbMath0579.65030OpenAlexW2059029453MaRDI QIDQ1067356
Publication date: 1984
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(84)90025-9
backward error analysisfinite precision arithmeticpartial reorthogonalizationsemiorthogonalitysymmetric Lanczos algorithm
Related Items (29)
The joint bidiagonalization process with partial reorthogonalization ⋮ Towards a black box Lanczos program ⋮ The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision ⋮ A study of defect-based error estimates for the Krylov approximation of \(\varphi\)-functions ⋮ Estimates in quadratic formulas ⋮ Unnamed Item ⋮ A Lanczos method for approximating composite functions ⋮ Abstract perturbed Krylov methods ⋮ The Short-Term Rational Lanczos Method and Applications ⋮ Iterative numerical methods for sampling from high dimensional Gaussian distributions ⋮ vibro -Lanczos, a symmetric Lanczos solver for vibro-acoustic simulations ⋮ M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions ⋮ Numerical solution of linear eigenvalue problems ⋮ Low-Rank Updates of Matrix Functions ⋮ Computational Materials Science and Engineering ⋮ Cucheb: a GPU implementation of the filtered Lanczos procedure ⋮ Estimating the largest singular values of large sparse matrices via modified moments ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix ⋮ Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem ⋮ Lanczos pseudospectral method for initial-value problems in electrodynamics and its applications to ionic crystal gratings ⋮ Bilinear Lanczos components for fast dimensionality reduction and feature extraction ⋮ Extended Lanczos bidiagonalization algorithm for low rank approximation and its applications ⋮ Matrix-free Krylov iteration for implicit convolution of numerically low-rank data ⋮ Thick-restart Lanczos method for electronic structure calculations ⋮ On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics ⋮ New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix ⋮ Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides ⋮ On the real convergence rate of the conjugate gradient method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- The Lanczos Algorithm With Partial Reorthogonalization
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Solution of Sparse Indefinite Systems of Linear Equations
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- The Lanczos Algorithm with Selective Orthogonalization
- How to Make the Lanczos Algorithm Converge Slowly
- Estimates for Some Computational Techniques in Linear Algebra
- Computational Variants of the Lanczos Method for the Eigenproblem
This page was built for publication: Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
