In a paralIel linear system solution, an efficient usage of a multiprocessor system is usually achieved by implementing algorithms with high degree of parallelism and good convergence properties as well as by tuning parallel codes to a particular system. Among the software tools that facilitate this development is PSPARSLIB, a suite of codes for solving sparse linear systems of equations. PSPARSLIB takes a modular approach to constructing a solution method and has logic-transparent computational kernels that can be adapted to the problem at hand. Here, we outline a few parallel solution methods incorporated recently in PSPARSLIB. We give a rationale for implementing these techniques and present several numerical experiments.
|Original language||English (US)|
|Title of host publication||Applied Parallel Computing|
|Subtitle of host publication||Large Scale Scientific and Industrial Problems - 4th International Workshop, PARA 1998, Proceedings|
|Editors||Bo Kagstrom, Erik Elmroth, Jack Dongarra, Jerzy Wasniewski|
|Number of pages||7|
|ISBN (Print)||3540654143, 9783540654148|
|State||Published - 1998|
|Event||4th International Workshop on Applied Parallel Computing, PARA 1998 - Umea, Sweden|
Duration: Jun 14 1998 → Jun 17 1998
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||4th International Workshop on Applied Parallel Computing, PARA 1998|
|Period||6/14/98 → 6/17/98|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.