Skip to main content
SpringerLink
Log in

Data structures, computational, and communication kernels for distributed memory sparse iterative solvers

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 964))

Included in the following conference series:

Abstract

Domain Decomposition techniques constitute an important class of methods especially appropriate in a parallel computing environment, but only a few general purpose codes based on these techniques have been developed so far. In this work, we attempt to develop not only algorithms but also software libraries and tools to help in the parallel implementation of such techniques. These algorithms and tools form P-SPARSLIB, a library of distributed sparse iterative solvers.

Work supported by ARPA under grant number NIST 60NANB2D1272

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ashby, S. F., and M. Seager: A proposed standard for iterative linear solvers. Technical report, Lawrence Livermore National Laboratory (1990).

    Google Scholar 

  2. Beguelin, A., J. Dongarra, A. Geist, R. Manchek, K. Moore, and V. Sunderam: Tools for heterogeneous network computing, In: Proceedings of the 6th SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, (1993) 854–862.

    Google Scholar 

  3. Gropp, W., E. Lusk, and A. Skjellum: Using MPI: Portable Parallel Programming with the Message-Passing Interface, MIT Press, 328 pp., 1994.

    Google Scholar 

  4. Saad, Y., and M. H. Schultz: GMRES: a generalised minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7 (1986) 856–869.

    Google Scholar 

  5. Saad, Y.: A flexible inner-outer preconditioned GMRES algorithm. SIAM J. Sci. Statist. Comput. 14 (1993) 461–469.

    Google Scholar 

Download references

Author information

Author notes

  1. Andrei V. Malevsky

    Present address: Centre de Recherche en Calcul Appliqué, 5160, boul. Décarie, bureau 400, H3X 2H9, Montréal, Québec, Canada

Authors and Affiliations

  1. Department of Computer Science, University of Minnesota, 200 Union Street S.E., 55455, Minneapolis, MN, USA

    Yousef Saad

  2. National Center for Supercomputing Applications, 405 N. Mathews Ave., 61801, Urbana, Il, USA

    Andrei V. Malevsky

Authors
  1. Yousef Saad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrei V. Malevsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saad, Y., Malevsky, A.V. (1995). Data structures, computational, and communication kernels for distributed memory sparse iterative solvers. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1995. Lecture Notes in Computer Science, vol 964. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60222-4_115

Download citation

  • DOI: https://doi.org/10.1007/3-540-60222-4_115

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60222-4

  • Online ISBN: 978-3-540-44754-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation