Conjugate gradient and Lanczos methods for sparse matrices on distributed memory multiprocessors (Q1373792)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1091355
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conjugate gradient and Lanczos methods for sparse matrices on distributed memory multiprocessors |
scientific article; zbMATH DE number 1091355 |
Statements
Conjugate gradient and Lanczos methods for sparse matrices on distributed memory multiprocessors (English)
0 references
7 September 1998
0 references
The paper presents algorithms for iteratively solving sparse systems of linear equations arising by the discretization of differential equations and corresponding eigenproblems on parallel systems with distributed memory. The conjugate gradient and Lanczos methods have been parallelized. The approaches of flexible data distribution, overlapping the communication and computation are applied. The algorithms developed have been tested successfully for large finite element matrices on the Paragon XP/S 10 system.
0 references
parallel computation
0 references
conjugate gradient method
0 references
Lanczos method
0 references
parallel distributed memory systems
0 references
algorithms
0 references
eigenproblems
0 references
