Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

27 relations
ARPACKArnoldi iterationBidiagonalizationBlock Lanczos algorithm
Expand

Broader (1)

Numerical linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator
We give a novel spectral approximation algorithm for the balanced (edge-)separator problem that, given a graph G, a constant… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Model reduction of state space systems via an implicitly restarted Lanczos method
The nonsymmetric Lanczos method has recently received significant attention as a model reduction technique for large-scale… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
In this paper, we propose a restarted variant of the Lanczos method for symmetric eigenvalue problems named the thick-restart… Expand
  • table 3.1
  • figure 3.1
  • table 3.2
  • figure 3.2
  • table 3.3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large… Expand
  • figure 4.1
  • figure 4.2
  • figure 6.1
  • figure 6.2
  • figure 6.3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
  • J Kuczy, H. Wo
  • 1992
    • Corpus ID: 2516446
Our problem is to compute an approximation to the largest eigenvalue of an n n large symmetric positive deenite matrix with… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
A Look Ahead Lanczos Algorithm for Unsymmetric Matrices
Abstract : The two sided Lanczos algorithm is known to suffer from serious breakdowns. These occur when the associated moment… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1984
Highly Cited
1984
The Lanczos algorithm with partial reorthogonalization
The Lanczos algorithm is becoming accepted as a powerful tool for finding the cigenvalues and for solving linear systems of… Expand
  • figure 3.2
  • figure 5.1
  • figure 5.2
  • figure 6.1
  • figure 6.2
Is this relevant?
Highly Cited
1981
Highly Cited
1981
A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
We present a block Lanczos method to compute the largest singular values and corresponding left and right singular vectors of a… Expand
Is this relevant?
Highly Cited
1980
Highly Cited
1980
The spectral transformation Lánczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems
A new algorithm is developed which computes a specified number of eigenvalues in any part of the spectrum of a generalized… Expand
  • figure 1.1
  • table 4.1
  • table 4.2
  • figure 6.1
  • figure 6.2
Is this relevant?
Highly Cited
1979
Highly Cited
1979
The Lanczos algorithm with selective orthogonalization
The simple Lanczos process is very effective for finding a few extreme eigenvalues of a large symmetric matrix along with the… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE