Skip to search formSkip to main contentSkip to account menu

Lanczos algorithm

Known as: Block Lanczos, Lanczos iteration, Lanczos method 
The Lanczos algorithm is a direct algorithm devised by Cornelius Lanczos that is an adaptation of power methods to find the most useful eigenvalues… 
Wikipedia (opens in a new tab)

Related topics

Related topics

27 relations
ARPACKArnoldi iterationBidiagonalizationBlock Lanczos algorithm

Broader (1)

Numerical linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Novel numerical methods for solving the time-space fractional diffusion equation in 2D
In this paper, a time-space fractional diffusion equation in two dimensions (TSFDE2D) with homogeneous Dirichlet boundary… 
2000
2000
A symmetry exploiting Lanczos method for symmetric Toeplitz matrices
Several methods for computing the smallest eigenvalues of a symmetric and positive definite Toeplitz matrix T have been studied… 
1999
1999
B-355 a Note on the Calculation of Step-lengths in Interior-point Methods for Semideenite Programming
In each iteration of an interior-point method for semideenite programming, the maximum step-length that can be taken by the… 
1998
1998
RESONANCE AFFECTED SCATTERING: COMPARISON OF TWO HYBRID METHODS INVOLVING FILTER DIAGONALIZATION AND THE LANCZOS METHOD
We apply two hybrid methods for solving scattering problems affected by resonances, to a four-dimensional reactive surface… 
Highly Cited
1997
Highly Cited
1997
A subspace algorithm for the identification of discrete time frequency domain power spectra
1997
1997
Empirical potential energy surface for Ar⋅SH/D and Kr⋅SH/D
Experimental data from vibrationally and rotationally resolved laser induced fluorescence experiments have been used to produce… 
1996
1996
A Parallel Version of the Unsymmetric Lanczos Algorithm and its Application to QMR
A new version of the unsymmetric Lanczos algorithm without l ok-ahead is described combining elements of numerical stability and… 
1993
1993
Semi-duality in the two-sided lanczos algorithm
Lanczos vectors computed in finite precision arithmetic by the three-term recurrence tend to lose their mutual biorthogonality… 
Highly Cited
1982
Highly Cited
1982
Analysis of the Look Ahead Lanczos Algorithm.
Abstract : The two-sided Lanczos algorithm is known to suffer instability in the form of serious breakdown. This occurs when the… 
1981
1981
Analyses of the lanczos algorithm and of the approximation problem in richardson's method
Two algorithms of use in sparse matrix computation are studied. The rounding errors of the computational Lanczos algorithm are… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)