Results 151 to 160 of about 16,479 (201)

Atomistic simulations of out-of-equilibrium quantum nuclear dynamics. [PDF]

NPJ Comput Mater
Libbi F, Johansson A, Monacelli L, Kozinsky B.   +3 more
europepmc   +1 more source

The role of artificial intelligence and deep learning in determining the histopathological grade of pancreatic neuroendocrine tumors by using EUS images. [PDF]

Endosc Ultrasound
Kiremitci S, Seven G, Silahtaroglu G, Kochan K, Degirmencioglu Tosun S, Senturk H.   +5 more
europepmc   +1 more source

Lanczos algorithm on the grassmann manifold

, 2008
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Nested Lanczos: implicitly restarting an unsymmetric Lanczos algorithm

Numerical Algorithms, 1998
The paper presents a generalization of the concept of implicitly restarting and iterative algorithm to the Lanczos method for eigenvalue problems. It is shown that a full run of the Lanczos algorithm on the small, projected eigenvalue problem generates a biorthogonal factorization for the Lanczos bases.
De Samblanx, Gorik, Bultheel, Adhemar
openaire   +1 more source

On randomized Lanczos algorithms

Proceedings of the 1997 international symposium on Symbolic and algebraic computation - ISSAC '97, 1997
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algorithm that has been used for integer factorization, and to the (provably reliable) algorithm of Wiedemann.
Wayne Eberly, Erich Kaltofen
openaire   +1 more source

Modified explicitly restarted Lanczos algorithm

Computer Physics Communications, 1998
Convergence acceleration and optimization in computing eigenvectors and eigenvalues of very large sparse matrices is obtained by the modified explicitly restarted Lanczos method. The proposed algorithm can calculate the multiplicities of eigenvalues, the required memory is small, and it can be easily implemented.
openaire   +3 more sources

Two-Sided Arnoldi and Nonsymmetric Lanczos Algorithms

SIAM Journal on Matrix Analysis and Applications, 2002
The paper proposes a new two-sided block Arnoldi recursion in order to define a model reduction procedure for large, linear, time-invariant, multi-input/multi-output differential algebraic systems. This procedure is proved to have maximum block moment properties.
Cullum, Jane, Zhang, Tong
openaire   +3 more sources

Algorithmic Fault Tolerance Using the Lanczos Method

SIAM Journal on Matrix Analysis and Applications, 1992
The problem of algorithm-based fault tolerance is considered. It is shown how very general sequences of polynomials can be used to generate the checksums, so as to reduce the chance of numerical overflows. Further it is shown how a clever use of the Lanczos algorithm can be applied in the error location and correction steps, so as to save on the amount
Boley, Daniel L., Brent, Richard P., Golub, Gene H., Luk, Franklin T.   +3 more
openaire   +1 more source

Improved Lanczos Algorithms for Blackbox MRS Data Quantitation

Journal of Magnetic Resonance, 2002
Magnetic resonance spectroscopy (MRS) has been shown to be a potentially important medical diagnostic tool. The success of MRS depends on the quantitative data analysis, i.e., the interpretation of the signal in terms of relevant physical parameters, such as frequencies, decay constants, and amplitudes.
Laudadio T, Mastronardi N, Vanhamme L, Van Hecke P, Van Huffel S   +4 more
openaire   +4 more sources

BiCG/QMR and Lanczos algorithms

2020
In this chapter we describe Krylov methods using short recurrences, like Lanczos algorithms, BiCG, and QMR which use biorthogonal bases of the Krylov subspaces.
Gérard Meurant, Jurjen Duintjer Tebbens
openaire   +1 more source