Results 131 to 140 of about 1,759 (181)

Ultrafast visual perception beyond human capabilities enabled by motion analysis using synaptic transistors. [PDF]

open access: yesNat Commun
Wang S   +16 more
europepmc   +1 more source

On the Lanczos method and the method of moments

Journal of Physics G: Nuclear Physics, 1978
The authors analyse some aspects of the numerically well-behaved Lanczos method of tri-diagonalising a matrix and the mathematically equivalent but numerically disastrous method of moments. It is shown how the elements of the Lanczos tri-diagonal matrix depend only on certain identifiable contributions to the moments, these contributions being those ...
R R Whitehead, A Watt
openaire   +1 more source

On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods

SIAM Journal on Numerical Analysis, 1980
Theoretical error bounds are established, improving those given by S. Kaniel. Similar inequalities are found for the eigenvectors by using bounds on the acute angle between the exact eigenvectors a...
openaire   +2 more sources

The Lanczos method and signal extrapolation

ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005
A technique for signal extrapolation based on the Lanczos method for tridiagonalizing a matrix is discussed. This technique is compared with two previously studied methods, one based on singular value decomposition (SVD) and the other using the conjugate gradient method.
openaire   +1 more source

On the Generalized Lanczos Trust-Region Method

SIAM Journal on Optimization, 2017
Summary: The so-called trust-region subproblem gets its name in the trust-region method in optimization and also plays a vital role in various other applications. Several numerical algorithms have been proposed in the literature for solving small-to-medium size dense problems as well as for large-scale sparse problems.
Lei-Hong Zhang   +2 more
openaire   +2 more sources

Lanczos-type Methods for Continuation Problems

Numerical Linear Algebra with Applications, 1997
The authors introduce Lanczos type methods as fast solvers for continuation problems. The symmetric Lanczos method is modified, moreover, for indefinite linear systems. The presented algorithms are used for calculation of simple bifurcation points on the solution curve.
C.-S. Chien, Z.-L. Weng, C.-L. Shen
openaire   +2 more sources

A Hermitian Lanczos Method for Normal Matrices

SIAM Journal on Matrix Analysis and Applications, 2002
An algorithm is presented for iteratively solving a linear system \(Nx= b\), with a normal matrix \(N\), with an optional 3-term recurrence by extending the Hermitian Lanczos method to normal matrices. To this end the Toeplitz decomposition of \(N\), defined via \(N= H+iK\) with Hermitian \(H\) and \(K\), is employed. The key is to notice that \(N^{-1}\
openaire   +1 more source

Vector-Orthogonality and Lanczos-Type Methods

Numerical Algorithms, 2002
A Lanczos-type method, using formal vector orthogonality, is proposed for solving a linear system. An algorithm is given with a strategy being defined to change the dimension of vector orthogonality by increasing or decreasing the dimension, which allow for leading the algorithm and controlling the numerical problem.
openaire   +1 more source

Home - About - Disclaimer - Privacy