Skip to main content

A Block Fourier Decomposition Method

  • Conference paper
  • First Online:

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

Abstract

In this paper, we present a parallel block decomposition method for a special class of block tridiagonal matrices of the form K = block-tridiag [B, A, B] and its variants, where A and B, A,B, ∈ , are general square matrices. Our decomposition method is closely related to the classical fast Poisson solver using Fourier analysis (simply referred to as FPS in this paper). Unlike FPS, our approach orthogonally decomposes K into q diagonal blocks, instead of p blocks as achieved by FPS. Furthermore, FPS employs the eigenpairs of A and B and requires that A and B be symmetric and commute. Our approach does not impose any such constraints and uses only the eigenvectors of the tridiagonal matrix T = tridiag [b, a, b] and its variants, in a block form, where a and b are scalars. Therefore, this approach has wider applications than FPS and lends itself to parallel and distributed computations for solving both linear systems and eigenvalue problems as well.

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.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about 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  MathSciNet  MATH  Google Scholar 

  2. F. Chen and A. Goshtasby: A parallel B-spline surface fitting algorithm, ACM Trans. Graphics, Vol. 8, No. 1, 1989, pp. 41–50.

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. L. Meirovitch: Computatinal Methods in Structural Dynamics, Sijthoff & Noordhoff, Maryland, 1980.

    Google Scholar 

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

    Google Scholar 

  6. T. Rossi and J. Toivanen: A parallel fast direct solver for block tridiagonal systems with separable matrices of arbitrary dimension, SIAM J. on Scientific Computing, Vol. 20, No. 5, 1999, pp. 1778–1793.

    Article  MathSciNet  MATH  Google Scholar 

  7. 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  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, HC. (2002). A Block Fourier Decomposition Method. In: Fagerholm, J., Haataja, J., Järvinen, J., Lyly, M., Råback, P., Savolainen, V. (eds) Applied Parallel Computing. PARA 2002. Lecture Notes in Computer Science, vol 2367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48051-X_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-48051-X_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48051-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics