Skip to main content

Parallel Performance of a 3D Elliptic Solver

  • Conference paper
  • First Online:
Numerical Analysis and Its Applications (NAA 2000)

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

Included in the following conference series:

  • 1243 Accesses

Abstract

It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic problems have good numerical properties and a potential for high parallel efficiency. In this note parallel performance of a circulant block-factorization based preconditioner applied to a 3D model problem is investigated. The aim of the presentation is to report on the experimental data obtained on SUN Enterprise 3000, SGI/Cray Origin 2000, Cray J-9x, Cray T3E computers and on two PC clusters.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. Bar-On, M. Paprzycki, High Performance Solution of Complex Symmetric Eigenproblem,Numerical Algorithms, 18 (1998) 195–208.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. H. Chan, T. F. Chan, Circulant preconditioners for elliptic problems, J. Num. Lin. Alg. Appl., 1 (1992) 77–101.

    Google Scholar 

  3. I. Lirkov, S. Margenov, Conjugate gradient method with circulant block-factorization preconditioners for 3D elliptic problems, In Proceedings of the Workshop # 3 Copernicus 94-0820 “HiPerGeoS” project meeting, Rožnov pod Radhoštěm, 1996.

    Google Scholar 

  4. I. Lirkov, S. Margenov, Parallel complexity of conjugate gradient method with circulant block-factorization preconditioners for 3D elliptic problems. In Recent Advances in Numerical Methods and Applications, O. P. Iliev, M. S. Kaschiev, Bl. Sendov, P. V. Vassilevski, eds., World Scientific, Singapore, (1999) 455–463.

    Google Scholar 

  5. I. Lirkov, S. Margenov, P. S. Vassilevski, Circulant block-factorization preconditioners for elliptic problems, Computing, 531( 1994) 59–74.

    Article  MATH  MathSciNet  Google Scholar 

  6. C. Van Loan, Computational frameworks for the fast Fourier transform, SIAM, Philadelphia, 1992.

    MATH  Google Scholar 

  7. M. Snir, St. Otto, St. Huss-Lederman, D. Walker, J. Dongara, MPI: The Complete Reference, Scientific and engineering computation series, The MIT Press,Cambridge Massachusetts, 1997, Second printing.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lirkov, I., Margenov, S., Paprzycki, M. (2001). Parallel Performance of a 3D Elliptic Solver. In: Vulkov, L., Yalamov, P., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2000. Lecture Notes in Computer Science, vol 1988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45262-1_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-45262-1_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41814-6

  • Online ISBN: 978-3-540-45262-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics