BIT Numerical Mathematics

, Volume 36, Issue 1, pp 110–121 | Cite as

Higher-order quadratures for circulant preconditioned Wiener-Hopf equations

  • Fu-Rong Lin
  • Michael K. Ng
Article

Abstract

In this paper, we consider solving matrix systems arising from the discretization of Wiener-Hopf equations by preconditioned conjugate gradient (PCG) methods. Circulant integral operators as preconditioners have been proposed and studied. However, the discretization of these preconditioned equations by employing higher-order quadratures leads to matrix systems that cannot be solved efficiently by using fast Fourier transforms (FFTs). The aim of this paper is to propose new preconditioners for Wiener-Hopf equations. The discretization of these preconditioned operator equations by higher-order quadratures leads to matrix systems that involve only Toeplitz, circulant and diagonal matrix-vector multiplications and hence can be computed efficiently by FFTs in each iteration. We show that with the proper choice of kernel functions of Wiener-Hopf equations, the resulting preconditioned operators will have clustered spectra and therefore the PCG method converges very fast. Numerical examples are given to illustrate the fast convergence of the method and the improvement of the accuracy of the computed solutions with using higher-order quadratures.

Key words

Circulant integral operator Wiener-Hopf equation high-order quadrature preconditioned conjugate gradient method accuracy 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. Ammar and W. Gragg,Superfast Solution of Real Positive Definite Toeplitz Systems, SIAM J. Matrix Anal. Appl. 9 (1988), pp. 61–76.Google Scholar
  2. 2.
    R. Chan, X. Jin and M. Ng,Circulant Integral Operators as Preconditioners for Wiener-Hopf Equations, Integr. Equat. Oper. Theory, 21 (1995), pp. 12–23.Google Scholar
  3. 3.
    I. Gohberg and I. Feldman,Convolution Equations and Projection Methods for Their Solution, Transl. Math. Monographs, V41 (1974), Amer. Math. Soc. Providence, RI.Google Scholar
  4. 4.
    I. Gohberg and S. Goldberg,Basic Operator Theory, Birkhäuser, Boston, Basel, Stuttgart, 1981.Google Scholar
  5. 5.
    I. Gohberg, M. Hanke and I. Koltracht,Fast Preconditioned Conjugate Gradient Algorithms for Wiener-Hopf Integral Equations, SIAM J. Numer. Anal., 31 (1994), pp. 429–443.Google Scholar
  6. 6.
    G. Golub and C. Van Loan,Matrix Computations, Second Edition, Johns Hopkins Press, Baltimore, 1989.Google Scholar
  7. 7.
    T. Korner,Fourier Analysis, Cambridge University Press, New York, 1988.Google Scholar
  8. 8.
    G. Strang,A Proposal for Toeplitz Matrix Calculations, Stud. Appl. Math., 74 (1986), pp. 171–176.Google Scholar

Copyright information

© BIT Foundation 1996

Authors and Affiliations

  • Fu-Rong Lin
    • 1
  • Michael K. Ng
    • 2
  1. 1.Department of MathematicsUniversity of Hong KongPokfulam RoadHong Kong
  2. 2.Computer Sciences Laboratory, Research School of Information Sciences and EngineeringThe Australian National UniversityCanberraAustralia

Personalised recommendations