Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
From MaRDI portal
Publication:5264995
DOI10.1137/140990735zbMath1319.65024OpenAlexW591632009MaRDI QIDQ5264995
Erin Claire Carson, James W. Demmel
Publication date: 21 July 2015
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140990735
Lanczos methoderror analysisconditioningKrylov subspace methodsroundoff errorfinite precisionavoiding communication
Related Items
Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods, Avoiding Communication in Primal and Dual Block Coordinate Descent Methods, Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations, On the cost of iterative computations, An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating., Block Modified Gram--Schmidt Algorithms and Their Analysis, Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the generation of Krylov subspace bases
- Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse
- Parallel iterative S-step methods for unsymmetric linear systems
- A performance model for Krylov subspace methods on mesh-based parallel computers
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- s-step iterative methods for symmetric linear systems
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- A class of Lanczos-like algorithms implemented on parallel computers
- An efficient nonsymmetric Lanczos method on parallel vector computers
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process
- Principal submatrices. II: The upper and lower quadratic inequalities
- An iterative method for finding characteristic vectors of a symmetric matrix
- Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods
- A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of $s$-Step Krylov Subspace Methods
- An Augmented Stability Result for the Lanczos Hermitian Matrix Tridiagonalization Process
- The Lanczos Algorithm With Partial Reorthogonalization
- On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Implementation of the GMRES Method Using Householder Transformations
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- The Lanczos Algorithm with Selective Orthogonalization
- A Newton basis GMRES implementation
- Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- On Stabilization and Convergence of Clustered Ritz Values in the Lanczos Method
- The Lanczos and Conjugate Gradient Algorithms
- Computational Variants of the Lanczos Method for the Eigenproblem
