Search for: [Abstract = "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 computing dot products increasingly limits the parallel scalability."]

Number of results: 1