On Estimating the Largest Eigenvalue with the Lanczos Algorithm
From MaRDI portal
Cites work
Cited in
(20)- The rate of convergence of conjugate gradients
- The use of a refined error bound when updating eigenvalues of tridiagonals
- The convergence behavior of Ritz values in the presence of close eigenvalues
- Evaluating the Fréchet derivative of the matrix exponential
- Minimal eigenvalue of a real symmetric positive definite Toeplitz matrix
- Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrix
- An efficient communications strategy for finite element methods on the Connection Machine CM-5 system
- An adaptive block Lanczos algorithm
- Computing the field of values and pseudospectra using the Lanczos method with continuation
- Frequency domain resilient consensus of multi-agent systems under IMP-based and non IMP-based attacks
- On sensitivity of Gauss-Christoffel quadrature
- Some basic information on information-based complexity theory
- Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
- Uniform Error Estimates for the Lanczos Method
- Subsampling algorithms for semidefinite programming
- Bounding the spectrum of large Hermitian matrices
- Experiments on the minimum linear arrangement problem
- Error Bounds for Lanczos-Based Matrix Function Approximation
- Quantum algorithm for estimating largest eigenvalues
- Spectral partitioning works: planar graphs and finite element meshes
This page was built for publication: On Estimating the Largest Eigenvalue with the Lanczos Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3932210)
