Lanczos resampling

Known as: Lanczos kernel, Lanczos3, Lanczos interpolation 
Lanczos resampling and Lanczos filtering are two applications of a mathematical formula. It can be used as a low-pass filter or used to smoothly… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Article history: Received 9 April 2008 Revised 23 August 2009 Accepted 13 February 2010 Available online 19 February 2010… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Nearest neighbor graphs are widely used in data mining and machine learning. The brute-force method to compute the exact kNN… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The Scalable Library for Eigenvalue Problem Computations (SLEPc) is a software library for computing a few eigenvalues and… (More)
  • table I
  • table II
Is this relevant?
Highly Cited
2005
Highly Cited
2005
New restarted Lanczos bidiagonalization methods for the computation of a few of the largest or smallest singular values of a… (More)
  • table 4.1
  • figure 4.1
  • figure 4.2
  • table 4.2
  • table 4.3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it computes either a small matrix… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • table III
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Shifted matrices, which differ by a multiple of the identity only, generate the same Krylov subspaces with respect to any fixed… (More)
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This dissertation focuses on e ciently forming reduced-order models for large, linear dynamic systems. Projections onto unions of… (More)
  • figure 4.4
  • figure 5.4
  • figure 5.5
  • figure 5.6
  • figure 5.7
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
SVDPACKC comprises four numerical (iterative) methods for computing the singular value decomposition (SVD) of large sparse… (More)
  • figure 4
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1969
Highly Cited
1969
row one of IL down the right edge of a strip of paper using the same spacing as for the observations. Now place this movable… (More)
  • table I
Is this relevant?