Efficiently solving large sparse linear systems on loosely coupled networks of computers is a rich and vibrant field of research. The induced heterogeneity and volatile nature of the aggregatedâ€¦ (More)

In this paper we describe an efficient iterative algorithm for solving large sparse linear systems on Grid computers and review some of its advantages and disadvantages. The algorithm is aâ€¦ (More)

We study two implementations of the Conjugate Gradient method for solving large sparse linear systems of equations on a heterogeneous computing grid, using GridSolve as grid middleware. We considerâ€¦ (More)

Efficient iterative solution of large linear systems on grid computers is a complex problem. The induced heterogeneity and volatile nature of the aggregated computational resources present numerousâ€¦ (More)

Parallel asynchronous iterative algorithms exhibit features that are extremely wellâ€“suited for Grid computing, such as lack of synchronisation points. Unfortunately, they also suffer from slowâ€¦ (More)

IDR(s) is a family of fast algorithms for iteratively solving large nonsymmetric linear systems. With cluster computing and in particular with Grid computing, the inner product is a bottleneckâ€¦ (More)

Acknowledgments This dissertation concludes four years of intense scientific research in the numerical analysis group at Delft University of Technology. It was an unforgettable experience and Iâ€¦ (More)