On Estimating the Largest Eigenvalue with the Lanczos Algorithm
From MaRDI portal
Publication:3932210
DOI10.2307/2007471zbMath0476.65024MaRDI QIDQ3932210
No author found.
Publication date: 1982
Full work available at URL: https://doi.org/10.2307/2007471
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
Experiments on the minimum linear arrangement problem, Spectral partitioning works: planar graphs and finite element meshes, 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, On sensitivity of Gauss-Christoffel quadrature, Some basic information on information-based complexity theory
Cites Work
