Bi-CGSTAB as an induced dimension reduction method

Parallel scientific computing on loosely coupled networks of computers

Solving large sparse linear systems efficiently on grid computers using an asynchronous iterative method as a preconditioner

Implementing the conjugate gradient method on a grid computer

IDR(s): A family of simple and fast algorithms for solving large nonsymmetric linear systems

Fast solution of nonsymmetric linear systems on Grid computers using parallel variants of IDR(s)

IDR(s) is a family of fast algorithms for iteratively solving large nonsymmetric linear systems [14]. With cluster computing and in particular with Grid computing, the inner product is a bottleneck operation. In this paper, three techniques are combined in order to alleviate this bottleneck. Firstly, the efficient and stable IDR(s) algorithm...