Skip to main content

Parallel implementation of a sparse approximate inverse preconditioner

  • Conference paper
  • First Online:

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

Abstract

A parallel implementation of a sparse approximate inverse (spai) preconditioner for distributed memory parallel processors (dmpp) is presented. The fundamental spai algorithm is known to be a useful tool for improving the convergence of iterative solvers for ill-conditioned linear systems. The parallel implementation (parspai) exploits the inherent parallelism in the spai algorithm and the data locality on the dmpps, to solve structurally symmetric (but non-symmetric) matrices, which typically arise when solving partial differential equations (pdes). Some initial performance results are presented which suggest the usefulness of parspai for tackling such large size systems on present day dmpps in a reasonable time.

The parspai preconditioner is implemented using the Message Passing Interface (mpi) and is embedded in the parallel library for unstructured mesh problems (plump).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. T. Barnard and H. D. Simon. A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems. Technical Report RNR-092-033, NASA Ames Research Center, Moffett Field, CA 94035, November 1992.

    Google Scholar 

  2. R. Barrett, M. Berry, T. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. van der Vorst. TEMPLATES for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM Publications, 1994.

    Google Scholar 

  3. Oliver Bröker, Vaibhav Deshpande, Peter Messmer, and William Sawyer. Parallel Library for Unstructured Mesh Problems. Technical Report CSCS-TR-96-15, Centro Svizzero di Calcolo Scientifico, CH-6928 Manno, Switzerland, May 1996.

    Google Scholar 

  4. E. Chow and Y. Saad. Approximate Inverse Preconditioners for General Sparse Matrices. In Proc. Colorado Conf. on Iterative Meth., 1994.

    Google Scholar 

  5. J. D. F. Cosgrove, J. C. Diaz, and A. Griewank. Approximate Inverse Preconditionings for Sparse Linear Systems. Intern. J. Computer Math., 14:91–110, 1992.

    Google Scholar 

  6. Vaibhav Deshpande, Marcus J. Grote, Peter Messmer, and William Sawyer. Parallel Sparse Approximate Inverse Preconditioner. Technical Report CSCS-TR-96-14, Centro Svizzero di Calcolo Scientifico, CH-6928 Manno, Switzerland, May 1996.

    Google Scholar 

  7. I. Duff, R. G. Grimes, and J. Lewis. User's Guide for the Harwell-Boeing Sparse Matrix Collection (Release I). Available from http://math.nist.gov:80/MatrixMarket/collections/hb.html.

    Google Scholar 

  8. G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins, second edition, 1989.

    Google Scholar 

  9. N. I. M. Gould and J. A. Scott. On Approximate-Inverse Preconditioners. Technical Report RAL 95-026, Rutherford Appleton Laboratory, 1995.

    Google Scholar 

  10. M. Grote and H. Simon. Parallel Preconditioning and Approximate Inverses on the Connection Machine. In Proc. of the Scalable High Performance Computing Conference (SHPCC), Williamsburg, VA, pages 76–83. IEEE Comp. Sci. Press 1992.

    Google Scholar 

  11. Marcus J. Grote and Thomas Huckle. Parallel Preconditioning with Sparse Approximate Inverses. SIAM Journal on Scientific Computing. In press.

    Google Scholar 

  12. Marcus J. Grote and Thomas Huckle. Effective Parallel Preconditioning with Sparse Approximate Inverses. In Proc. SIAM Conf. on Parallel Processing for Scientific Comp., San Francisco, pages 466–471. SIAM, 1995.

    Google Scholar 

  13. George Karypis and Vipin Kumar. MeTiS: Unstructured Graph Partitioning and Sparse Matrix Ordering System. Available from http://www.cs.umn.edu/∼karypis/metis/references.html.

    Google Scholar 

  14. L. Yu. Kolotilina, A. A. Nikishin, and A. Yu. Yeremin. Factorized Sparse Approximate Inverse (FSAI) Preconditionings for Solving 3D FE Systems on Massively Parallel Computers II. In R. Beauwens and P. de Groen, editors, Iterative Meth. in Lin. Alg., Proc. of the IMACS Internat. Sympos., Brussels, pages 311–312, 1991.

    Google Scholar 

  15. L. Yu. Kolotilina and A. Yu. Yeremin. Factorized Sparse Approximate Inverse Preconditionings. SIAM Journal on Matrix Analysis and Applications, 14(1):45–58, 1993.

    Article  Google Scholar 

  16. Ju. B. Lifshitz, A. A. Nikishin, and A. Yu. Yeremin. Sparse Approximate Inverse Preconditionings for Solving 3D CFD Problems on Massively Parallel Computers. In R. Beauwens and P. de Groen, editors, Iterative Meth. in Lin. Alg., Proc. of the IMACS Internat. Sympos., Brussels, pages 83–84, 1991.

    Google Scholar 

  17. Message Passing Interface Forum. MPI: a message-passing interface standard (version 1.1). Revision of article appearing in the International Journal of Supercomputing Applications, 8(3/4):157–416, 1994, June 1995.

    Google Scholar 

  18. C. Walshaw, M. Cross, M. Everett, and S. Johnson. A Parallelisable Algorithm for Partitioning Unstructured Meshes. In Alfonso Ferreira and Jose D. P. Rolim, editors, Parallel Algorithms for Irregular Problems: State of the Art, chapter 2, pages 25–44. Kluwer Academic Publishers, Dordrecht, Netherlands, August 1995. Collection of extended papers from Irregular'94 conference. [ISBN: 0-7923-3623-2].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Alfonso Ferreira José Rolim Yousef Saad Tao Yang

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deshpande, V., Grote, M.J., Messmer, P., Sawyer, W. (1996). Parallel implementation of a sparse approximate inverse preconditioner. In: Ferreira, A., Rolim, J., Saad, Y., Yang, T. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1996. Lecture Notes in Computer Science, vol 1117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030097

Download citation

  • DOI: https://doi.org/10.1007/BFb0030097

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61549-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics