Skip to main content

A Parallel Solver Using Block Fourier Decompositions

  • Conference paper
  • First Online:
Book cover Parallel and Distributed Processing and Applications (ISPA 2003)

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

  • 346 Accesses

Abstract

The block Fourier decomposition method recently proposed by the first author is a special method for decoupling any block tridiagonal matrix of the form K = block-tridiag [B, A, B], where A and B are square submatrices, into diagonal blocks. Unlike the traditional fast Poisson solver, block cyclic reductions, or the FACR algorithm, this approach does not require A and B be symmetric or commute. Presented in this paper is a parallel solver using this block decomposition method to solve linear systems whose coefficient matrices are of the form of K. We describe the computational procedure and implementation for parallel executions on distributed workstations. The performance from our numerical experiments is reported to demonstrate the usefulness of this approach.

This work was supported in part by the Army Research Laboratory under Grant No. DAAL01-98-2-D065.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. B.L. Buzbee, G.H. Golub, C.W. Nielson, On direct methods for solving Poisson’s equations. SIAM J. Numer. Anal., Vol. 7, No. 4, 1970, pp. 627–656.

    Article  MATH  MathSciNet  Google Scholar 

  2. H.C. Chen, A block Fourier decomposition method, Lecture Notes in Computer Science 2367 (Eds.: J. Fagerholm et al.), Spring-Verlag, 2002, pp. 351–358.

    Google Scholar 

  3. W. Gropp, E. Lusk and N. Doss, A high-performance, portable implementation of the MPI Message-Passing Interface standard, Parallel Computing, 22(6), 1996, pp. 789–828.

    Article  MATH  Google Scholar 

  4. R.W. Hockney, A fast direct solution of Poisson’s equation using Fourier analysis, J. ACM 12 (1965) pp. 95–113.

    Article  MATH  MathSciNet  Google Scholar 

  5. W.E. Milne, Numerical Solution of Differential Equations, Dover Publications, Inc., New York.

    Google Scholar 

  6. P.N. Swarztrauber, The methods of cyclic reduction, Fourier analysis, and the FACR algorithm for the discrete solution of Poisson’s equation on a rectangle, SIAM Rev. 19 (1977) pp. 490–501.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, HC., Tzeng, SY. (2003). A Parallel Solver Using Block Fourier Decompositions. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-37619-4_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40523-8

  • Online ISBN: 978-3-540-37619-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics