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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
The Lanczos algorithm is becoming accepted as a powerful tool for finding the eigenvalues and for solving linear systems of… (More)
  • figure 3.2
  • figure 5.1
  • figure 5.2
  • figure 6.1
  • figure 6.2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The Lanczos method is an iterative procedure to compute an orthogonal basis for the Krylov subspace generated by a symmetric… (More)
  • figure 3.1
  • table 3.1
  • figure 4.1
  • figure 6.1
  • table 6.1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper, we propose a restarted variant of the Lanczos method for symmetric eigenvalue problems named the thick-restart… (More)
  • table 3.1
  • figure 3.1
  • table 3.2
  • figure 3.2
  • table 3.3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The approximate minimization of a quadratic function within an ellipsoidal trust region is an important subproblem for many… (More)
  • table 6.1
  • table 6.2
  • table 6.3
  • table 6.4
  • table 6.5
Is this relevant?
1997
1997
Las Vegas algorithms that are basedon Lanczos’s method for solving symmetric linear systems are presented and analyzed. These… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
This paper presents a model reduction method for large-scale linear systems that is based on a Lanczos-type approach. A variant… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In this paper we show that the two-sided Lanczos procedure combined with implicit restarts, offers significant advantages over… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The Lanczos process is a well known technique for computing a few, say k, eigenvalues and associated eigenvectors of a large… (More)
  • table 5.1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
In Part I [6] of this paper, we have presented an implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Our problem is to compute an approximation to the largest eigenvalue of an n n large symmetric positive deenite matrix with… (More)
Is this relevant?