If you are experiencing problems downloading PDF or HTML fulltext, our helpdesk recommend clearing your browser cache and trying again. If you need help in clearing your cache, please click here . Still need help? Email help@ingentaconnect.com

Conjugate Gradient and Lanczos Methods for Sparse Matrices on Distributed Memory Multiprocessors

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.

Abstract:

Conjugate gradient methods for solving sparse systems of linear equations and Lanczos algorithms for sparse symmetric eigenvalue problems play an important role in numerical methods for solving discretized partial differential equations. When these iterative solvers are parallelized on a multiprocessor system with distributed memory, the data distribution and the communication scheme-depending on the data structures used for the sparse coefficient matrices-are crucial for efficient execution. Here, data distribution and communication schemes are presented that are based on the analysis of the indices of the nonzero matrix elements. On an Intel PARAGON XP/S 10 with 140 processors, the developed parallel variants of the solvers show good scaling behavior for matrices with different sparsity patterns stemming from real finite element applications.

Document Type: Short Communication

Affiliations: Central Institute for Applied Mathematics (ZAM), Research Centre Julich GmbH (KFA), Julich, 52425, Germany

Publication date: August 1, 1997

Related content

Tools

Favourites

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more