Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
From MaRDI portal
Cites work
- Computational Variants of the Lanczos Method for the Eigenproblem
- Eigenvalues of perturbed Hermitian matrices
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Estimates for Some Computational Techniques in Linear Algebra
- How to Make the Lanczos Algorithm Converge Slowly
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Practical use of the symmetric Lanczos process with re-orthogonalization
- Principal submatrices. II: The upper and lower quadratic inequalities
- Solution of Sparse Indefinite Systems of Linear Equations
- The Lanczos Algorithm with Selective Orthogonalization
- Use of the Lanczos Method for Finding Complete Sets of Eigenvalues of Large Sparse Symmetric Matrices
Cited in
(66)- A survey of Lanczos procedures for very large real 'symmetric' eigenvalue problems
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- On tridiagonalization of matrices
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- The Lanczos phenomenon - An interpretation based upon conjugate gradient optimization
- Lanczos method of tridiagonalization, Jacobi matrices and physics
- Computing eigenvalues of very large symmetric matrices. An implementation of a Lanczos algorithm with no reorthogonalization
- Large-scale complex eigenvalue problems
- A generalized nonsymmetric Lanczos procedure
- On application of the Lanczos method to solution of some partial differential equations
- Estimates in quadratic formulas
- Algebraic description of the finite Stieltjes moment problem
- Maintaining convergence properties of BiCGStab methods in finite precision arithmetic
- Numerical stability of GMRES
- Reliable updated residuals in hybrid Bi-CG methods
- Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
- Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems
- Towards backward perturbation bounds for approximate dual Krylov subspaces
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- Structure in loss of orthogonality
- Efficient semidefinite programming with approximate ADMM
- When does the Lanczos algorithm compute exactly?
- Accurate error estimation in CG
- Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions
- An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process
- The stabilization of weights in the Lanczos and conjugate gradient method
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- \textit{TimeEvolver}: a program for time evolution with improved error bound
- Inflationary dynamics for matrix eigenvalue problems
- Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
- Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
- The numerical stability analysis of pipelined conjugate gradient methods: historical context and methodology
- Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation
- On the cost of iterative computations
- Predict-and-Recompute Conjugate Gradient Variants
- On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic
- Accuracy of the Lanczos process for the eigenproblem and solution of equations
- Laplacian preconditioning of elliptic PDEs: localization of the eigenvalues of the discretized operator
- Accuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Analyzing the effect of local rounding error propagation on the maximal attainable accuracy of the pipelined conjugate gradient method
- Error Bounds for Lanczos-Based Matrix Function Approximation
- An eigenvector-eigenvalue-identity for matrices with a non-semi-simple eigenvalue
- The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
- Sparse matrices
- The behavior of the Gauss-Radau upper bound of the error norm in CG
- Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
- Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems
- Stability of the Lanczos algorithm on matrices with regular spectral distributions
- Towards understanding CG and GMRES through examples
- Analyzing vector orthogonalization algorithms
- Recycling of solution spaces in multipreconditioned FETI methods applied to structural dynamics
- Faster randomized partial trace estimation
- A posteriori error bounds for the block-Lanczos method for matrix function approximation
- Backward error analysis of the Lanczos bidiagonalization with reorthogonalization
- Lanczos Algorithm
- Lanczos algorithm explained in statistics
- Block CG algorithms revisited
- On finite precision block Lanczos computations
- Acceleration methods for fixed-point iterations
- A matrix eigenvalue-eigenvector equality for semi-simple eigenvalues
- Inexact subspace projection methods for low-rank tensor eigenvalue problems
- On the real convergence rate of the conjugate gradient method
- The joint bidiagonalization process with partial reorthogonalization
- Abstract perturbed Krylov methods
This page was built for publication: Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1157667)