Accuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision

Recommendations

Accuracy of the Lanczos process for the eigenproblem and solution of equations
Uniform accuracy of eigenpairs from a shift‐invert Lanczos method
Error bounds in the simple Lanczos procedure for computing functions of symmetric matrices and eigenvalues
Accuracy of the difference scheme of solving the eigenvalue problem for the Laplacian
Error analysis of the symplectic Lanczos method for the symplectic eigenvalue problem
Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
scientific article; zbMATH DE number 4211373
High relative accuracy algorithms for the symmetric eigenproblem
Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
The effects of inexact solvers in algorithms for symmetric eigenvalue problems

Cites work

scientific article; zbMATH DE number 1069613 (Why is no real title available?)
scientific article; zbMATH DE number 1953444 (Why is no real title available?)
scientific article; zbMATH DE number 6159604 (Why is no real title available?)
scientific article; zbMATH DE number 3408799 (Why is no real title available?)
scientific article; zbMATH DE number 961607 (Why is no real title available?)
A Newton basis GMRES implementation
A class of Lanczos-like algorithms implemented on parallel computers
A performance model for Krylov subspace methods on mesh-based parallel computers
A residual replacement strategy for improving the maximum attainable accuracy of $s$-step Krylov subspace methods
Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process
An augmented stability result for the Lanczos Hermitian matrix tridiagonalization process
An efficient nonsymmetric Lanczos method on parallel vector computers
An iterative method for finding characteristic vectors of a symmetric matrix
Avoiding communication in nonsymmetric Lanczos-based Krylov subspace methods
Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
Communication lower bounds and optimal algorithms for numerical linear algebra
Computational Variants of the Lanczos Method for the Eigenproblem
Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
Implementation of the GMRES Method Using Householder Transformations
Krylov subspace methods in finite precision: A unified approach
On Stabilization and Convergence of Clustered Ritz Values in the Lanczos Method
On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
On the generation of Krylov subspace bases
Parallel iterative S-step methods for unsymmetric linear systems
Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
Principal submatrices. II: The upper and lower quadratic inequalities
Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
The Lanczos Algorithm With Partial Reorthogonalization
The Lanczos Algorithm with Selective Orthogonalization
The Lanczos and Conjugate Gradient Algorithms
The Lanczos and conjugate gradient algorithms in finite precision arithmetic
Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse
s-step iterative methods for symmetric linear systems

Cited in

(8)

Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
Accuracy of the Lanczos process for the eigenproblem and solution of equations
Block Modified Gram--Schmidt Algorithms and Their Analysis
Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
An adaptive $s$-step conjugate gradient algorithm with dynamic basis updating.
On the cost of iterative computations
Analyzing vector orthogonalization algorithms

This page was built for publication: Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264995)