Displaying similar documents to “A parallel block Lanczos algorithm and its implementation for the evaluation of some eigenvalues of large sparse symmetric matrices on multicomputers”

Inversion of square matrices in processors with limited calculation abillities

Krzysztof Janiszowski (2003)

International Journal of Applied Mathematics and Computer Science

Similarity:

An iterative inversion algorithm for a class of square matrices is derived and tested. The inverted matrix can be defined over both real and complex fields. This algorithm is based only on the operations of addition and multiplication. The numerics of the algorithm can cope with a short number representation and therefore can be very useful in the case of processors with limited possibilities, like different neuro-computers and accelerator cards. The quality of inversion can be traced...

The non-symmetric s-step Lanczos algorithm: Derivation of efficient recurrences and synchronization-reducing variants of BICG and QMR

Stefan Feuerriegel, H. Martin Bücker (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

The Lanczos algorithm is among the most frequently used iterative techniques for computing a few dominant eigenvalues of a large sparse non-symmetric matrix. At the same time, it serves as a building block within biconjugate gradient (BiCG) and quasi-minimal residual (QMR) methods for solving large sparse non-symmetric systems of linear equations. It is well known that, when implemented on distributed-memory computers with a huge number of processes, the synchronization time spent on...

Pivoting algorithm in class of ABS methods

Gabriela Kálnová (1996)

Archivum Mathematicum

Similarity:

Summary: The paper deals with a pivoting modification of the algorithm in the class of ABS methods. Numerical experiments compare this pivoting modification with the fundamental version. A hybrid algorithm for the solution of the linear system with the Hankel matrix is introduced.