-
Cornelius (Cornel)
Lanczos (Hungarian:
Lánczos Kornél,
pronounced [ˈlaːnt͡soʃ ˈkorneːl]; born as Kornél Lőwy,
until 1906: Löwy (Lőwy) Kornél; February...
-
Lanczos filtering and
Lanczos resampling are two
applications of a
certain mathematical formula. It can be used as a low-p****
filter or used to smoothly...
- The
Lanczos algorithm is an
iterative method devised by
Cornelius Lanczos that is an
adaptation of
power methods to find the m {\displaystyle m} "most...
- In mathematics, the
Lanczos approximation is a
method for
computing the
gamma function numerically,
published by
Cornelius Lanczos in 1964. It is a practical...
- of a size-N DFT as two size-N/2 DFTs is
sometimes called the Danielson–
Lanczos lemma,
since the
identity was
noted by
those two
authors in 1942 (influenced...
- In
computer science, the
block Lanczos algorithm is an
algorithm for
finding the
nullspace of a
matrix over a
finite field,
using only multiplication...
- The
Lanczos tensor or
Lanczos potential is a rank 3
tensor in
general relativity that
generates the Weyl tensor. It was
first introduced by Cornelius...
- {\displaystyle \left(\operatorname {sinc} {\frac {k}{m}}\right)^{p}} is the
Lanczos σ factor,
which is
responsible for
eliminating most of the
Gibbs phenomenon...
- Zheltkov, Dmitry; Zamarashkin, Nikolai; Matveev,
Sergey (2023). "How to Make
Lanczos-Montgomery Fast on
Modern Supercomputers?". In Voevodin, Vladimir; Sobolev...
- w[n]=\operatorname {sinc} \left({\frac {2n}{N}}-1\right)} used in
Lanczos resampling for the
Lanczos window, sinc ( x ) {\displaystyle \operatorname {sinc} (x)}...
