A library of distributed iterative linear system solvers. (English) Zbl 0866.65026
Summary: This paper describes the global structure of the distributed iterative linear system solvers library, and the design decisions underlying it. The library contains a number of popular iterative methods and parallel preconditioners, and handles several distributed storage formats. Implementations are available based on several underlying communication protocols.
MSC:
| 65F10 | Iterative numerical methods for linear systems |
| 65F35 | Numerical computation of matrix norms, conditioning, scaling |
| 65Y05 | Parallel numerical computation |
| 65Y15 | Packaged methods for numerical algorithms |
Keywords:
distributed iterative linear system solvers library; iterative methods; parallel preconditionersReferences:
| [1] | Choi, Y.; Dongarra, J. J.; Pozo, R.; Walker, D. W., Scalapack: a scalable linear algebra library for distributed memory concurrent computers, (Proceedings of the fourth symposium on the frontiers of massively parallel computation (Frontiers ’92). Proceedings of the fourth symposium on the frontiers of massively parallel computation (Frontiers ’92), McLean, VA (1992)), 120-127 |
| [2] | D’Azevedo, E.; Eijkhout, V.; Romine, C., Lapack working note 56: Reducing communication costs in the conjugate gradient algorithm on distributed memory multiprocessor, (Tech. Rept. CS-93-185 (1993), Computer Science Department, University of Tennessee: Computer Science Department, University of Tennessee Knoxville, TN) |
| [3] | Dongarra, J. J.; Whaley, R. C., Basic linear algebra communication subprograms: analysis and implementation across multiple parallel architectures, (Tech. Rept. (1994), Computer Science Department, University of Tennessee: Computer Science Department, University of Tennessee Knoxville, TN) |
| [4] | Eijkhout, V., Lapack working note 51: Qualitative properties of the conjugate gradient and Lanczos methods in a matrix framework, (Tech. Rept. CS 92-170 (1992), Computer Science Department, University of Tennessee: Computer Science Department, University of Tennessee Knoxville, TN) |
| [5] | Eijkhout, V.; Pozo, R., Data structures and algorithms for distributed sparse matrix operations, (Tech. Rept. (1994), Computer Science Department, University of Tennessee: Computer Science Department, University of Tennessee Knoxville, TN) |
| [6] | Eijkhout, V.; Pozo, R., Lapack working note 77, Basic concepts for distributed sparse linear algebra operations, (Tech. Rept. CS-94-240 (1994), Computer Science Department, University of Tennessee: Computer Science Department, University of Tennessee Knoxville, TN) |
| [7] | Geist, A.; Beguelin, A.; Dongarra, J.; Jiang, W.; Manchek, R.; Sunderam, V., PVM3 user’s guide and reference manual, (Tech. Rept. ORNL-TM12187 (1993), Oak Ridge National Laboratory) |
| [8] | Geist, A.; Heath, M.; Peyton, B.; Worley, P., PICL, a portable instrumented communication library, (Tech. Rept. ORNL/TM-11130 (1990), Oak Ridge National Laborarory) |
| [9] | Jones, M.; Plassmann, P., A parallel graph coloring heuristic, SIAM J. Sci. Statist. Comput., 14 (1993) · Zbl 0772.68046 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
