Uniform Error Estimates for the Lanczos Method
From MaRDI portal
(Redirected from Publication:5158757)
Recommendations
- Sharpness in rates of convergence for the symmetric Lanczos method
- Error bounds for the Lanczos methods for approximating matrix exponentials
- Uniform accuracy of eigenpairs from a shift‐invert Lanczos method
- Theoretical error bounds on the convergence of the Lanczos and block-Lanczos methods
- scientific article; zbMATH DE number 4211373
Cites work
- A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices
- A strong law for weighted sums of i.i.d. random variables
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Computing probabilistic bounds for extreme eigenvalues of symmetric matrices with the Lanczos method
- Estimates for Some Computational Techniques in Linear Algebra
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3037624 (Why is no real title available?)
- Interlacing of the zeros of Jacobi polynomials with different parameters
- Numerical methods for large eigenvalue problems
- On Estimates for the Weights in Gaussian Quadrature in the Ultraspherical Case
- On Estimating the Largest Eigenvalue with the Lanczos Algorithm
- On the randomized error of polynomial methods for eigenvector and eigenvalue estimates
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- On the zeros of spherical and ultraspherical polynomials
- Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm
- Spectral methods. Algorithms, analysis and applications.
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Tight query complexity lower bounds for PCA via finite sample deformed Wigner law
Cited in
(8)- Theoretical error bounds on the convergence of the Lanczos and block-Lanczos methods
- Error estimate for uniform approximation by Lagrange-Sturm-Liouville processes
- Error Estimates For The Lax — Friedrichs Scheme For Balance Laws
- Error Estimates for the Staggered Lax--Friedrichs Scheme on Unstructured Grids
- Error Bounds for Lanczos-Based Matrix Function Approximation
- Estimating the matrix p q norm
- Global convergence of Hessenberg shifted QR. III: Approximate Ritz values via shifted inverse iteration
- Scalable approximate optimal diagonal preconditioning
This page was built for publication: Uniform Error Estimates for the Lanczos Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158757)
