On Estimating the Largest Eigenvalue with the Lanczos Algorithm
From MaRDI portal
Publication:3932210
DOI10.2307/2007471zbMath0476.65024OpenAlexW4236352385MaRDI QIDQ3932210
No author found.
Publication date: 1982
Full work available at URL: https://doi.org/10.2307/2007471
Related Items (20)
The rate of convergence of conjugate gradients ⋮ Minimal eigenvalue of a real symmetric positive definite Toeplitz matrix ⋮ The use of a refined error bound when updating eigenvalues of tridiagonals ⋮ The convergence behavior of Ritz values in the presence of close eigenvalues ⋮ Some basic information on information-based complexity theory ⋮ On sensitivity of Gauss-Christoffel quadrature ⋮ An efficient communications strategy for finite element methods on the Connection Machine CM-5 system ⋮ Spectral partitioning works: planar graphs and finite element meshes ⋮ An adaptive block Lanczos algorithm ⋮ Computing the field of values and pseudospectra using the Lanczos method with continuation ⋮ Quantum algorithm for estimating largest eigenvalues ⋮ Uniform Error Estimates for the Lanczos Method ⋮ Evaluating the Fréchet derivative of the matrix exponential ⋮ Bounding the spectrum of large Hermitian matrices ⋮ Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph ⋮ Experiments on the minimum linear arrangement problem ⋮ Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrix ⋮ Subsampling Algorithms for Semidefinite Programming ⋮ Frequency domain resilient consensus of multi-agent systems under IMP-based and non IMP-based attacks ⋮ Error Bounds for Lanczos-Based Matrix Function Approximation
Cites Work
This page was built for publication: On Estimating the Largest Eigenvalue with the Lanczos Algorithm
