Displaying similar documents to “A parallel Cholesky algorithm for the solution of symmetric linear systems.”

A modified algorithm for the strict feasibility problem

D. Benterki, B. Merikhi (2010)

RAIRO - Operations Research

Similarity:

In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.

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...