Advertisement

BIT Numerical Mathematics

, Volume 42, Issue 4, pp 702–739 | Cite as

Fast Fourier Transform Solvers and Preconditioners for Quadratic Spline Collocation

  • Christina C. Christara
  • Kit Sun Ng
Article

Abstract

Quadratic Spline Collocation (QSC) methods of optimal order of convergence have been recently developed for the solution of elliptic Partial Differential Equations (PDEs). In this paper, linear solvers based on Fast Fourier Transforms (FFT)are developed for the solution of the QSC equations. The complexity of the FFT solvers is O(N2 log N), where N is the gridsize in one dimension. These direct solvers can handle PDEs with coefficients in one variable or constant, and Dirichlet, Neumann, alternating Dirichlet-Neumann or periodic boundary conditions, along at least one direction of a rectangular domain. General variable coefficient PDEs are handled by preconditioned iterative solvers. The preconditioner is the QSC matrix arising from a constant coefficient PDE. The convergence analysis of the preconditioner is presented. It is shown that, under certain conditions, the convergence rate is independent of the gridsize. The preconditioner is solved by FFT techniques, and integrated with one-step or acceleration methods, giving rise to asymptotically almost optimal linear solvers, with complexity O(N2 log N). Numerical experiments verify the effectiveness of the solvers and preconditioners, even on problems more general than the analysis assumes. The development and analysis of FFT solvers and preconditioners is extended to QSC equations corresponding to systems of elliptic PDEs.

Spline collocation elliptic boundary value problem eigenvalue problem fast Fourier transform iterative solver scaled Laplace preconditioner system of PDEs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. 1.
    B. Bialecki, Preconditioned Richardson and minimal residual iterative methods for piecewise Hermite bicubic orthogonal spline collocations equations, SIAMJ. Sci. Comput., 15 (1994), pp. 668-680.Google Scholar
  2. 2.
    B. Bialecki and X. C. Cai, H1-norm error bounds for piecewise Hermite bicubic orthogonal spline collocations schemes for elliptic boundary value problems, SIAM J. Numer. Anal., 31 (1994), pp. 1128-1146.Google Scholar
  3. 3.
    B. Bialecki, G. Fairweather, and K. Bennett, Fast direct solvers for piecewise Hermite bicubic orthogonal spline collocation equations, SIAM J. Numer. Anal., 29 (1992), pp. 156-173.Google Scholar
  4. 4.
    C. C. Christara, Quadratic spline collocation methods for elliptic partial differential equations, BIT, 34 (1994), pp. 33-61.Google Scholar
  5. 5.
    C. C. Christara, Parallel solvers for spline collocation equations, Advances in Engineering Software, 27 (1996), pp. 71-89.Google Scholar
  6. 6.
    C. C. Christara, X. Ding, and K. R. Jackson, An efficient transposition algorithm for distributed memory computers, in High Performance Computing Systems and Applications, A. Pollard, D. J. K. Mewhort, and D. F. Weaver, eds., Kluwer Academic Publishers, Dordrecht, 1999, pp. 349-368.Google Scholar
  7. 7.
    C. C. Christara and K. S. Ng, Quadratic spline collocation methods for systems of PDEs, DCS Tech. Rep. 318, University of Toronto, Toronto, Ontario, Canada, hau ftp://ftp.cs.utoronto.ca/na/Reports/ccc/sys.ps. Z, July 2001.Google Scholar
  8. 8.
    C. C. Christara and B. Smith, Multigrid and multilevel methods for quadratic spline collocation, BIT, 37 (1997), pp. 781-803.Google Scholar
  9. 9.
    A. Constas, Fast Fourier transform solvers for quadratic spline collocation, M. Sc. Thesis, Department of Computer Science, University of Toronto, Toronto, Ontario, Canada, July 1996.Google Scholar
  10. 10.
    K. D. Cooper and P. M. Prenter, Alternating direction collocation for separable elliptic partial differential equations, SIAM J. Numer. Anal., 28 (1991), pp. 711-727.Google Scholar
  11. 11.
    C. de Boor and B. Swartz, Collocation at Gaussian points, SIAM J. Numer. Anal., 10 (1973), pp. 582-606.Google Scholar
  12. 12.
    J. Douglas and T. Dupont, Collocation methods for parabolic equations in a singlespace variable, Lecture Notes in Mathematics, 385 (1974), pp. 1-147.Google Scholar
  13. 13.
    W. R. Dyksen, Tensor product generalized alternating direction implicit methods for solving separable linear elliptic partial differential equations, PhD thesis, Department of Computer Science, Purdue University, IN, 1982.Google Scholar
  14. 14.
    W. R. Dyksen, Tensor product generalized ADI methods for separable elliptic problems, SIAM J. Numer. Anal., 24 (1987), pp. 59-76.Google Scholar
  15. 15.
    Personal communication of G. Fairweather with the first author, April 2000.Google Scholar
  16. 16.
    A. Greenbaum, Diagonal scalings of the Laplacian as preconditioners for other elliptic differential operators., SIAM J. Matrix Anal. Appl., 13 (1992), pp. 826-846.Google Scholar
  17. 17.
    W. Gropp and B. Smith, Users Manual for KSP: Data-Structure-Neutral Codes Implementing Krylov Space Methods, Argonne National Laboratory, August 1993.Google Scholar
  18. 18.
    E. N. Houstis, J. R. Rice, C. C. Christara, and E. A. Vavalis, Performance of scientific software, in Mathematical Aspects of Scientific Software, J. R. Rice, ed., The IMA Volumes in Mathematics and its Applications, Vol. 14, Springer-Verlag, New York, 1988, pp. 123-156.Google Scholar
  19. 19.
    E. N. Houstis, E. A. Vavalis, and J. R. Rice, Convergence of an O(h4) cubic spline collocation method for elliptic partial differential equations, SIAM J. Numer. Anal., 25 (1988), pp. 54-74.Google Scholar
  20. 20.
    C. F. Van Loan, Computational Frameworks for the Fast Fourier Transform, Society for Industrial and Applied Mathematics, 1992.Google Scholar
  21. 21.
    B. Mossberg, Documentation for the FFT subroutines available in four libraries, NEC Systems Laboratory, Inc., August 1992.Google Scholar
  22. 22.
    K. S. Ng, Quadratic spline collocation methods for systems of elliptic PDEs, M.Sc. Thesis, Department of Computer Science, University of Toronto, Toronto, Ontario, Canada, April 2000.Google Scholar
  23. 23.
    P. Percell and M. F. Wheeler, A C1 finite element collocation method for elliptic equations, SIAM J. Numer. Anal., 17 (1980), pp. 605-622.Google Scholar
  24. 24.
    P. M. Prenter and R. D. Russell, Orthogonal collocation for elliptic partial differential equations, SIAM J. Numer. Anal., 13 (1976), pp. 923-939.Google Scholar

Copyright information

© Swets & Zeitlinger 2002

Authors and Affiliations

  • Christina C. Christara
    • 1
  • Kit Sun Ng
    • 1
  1. 1.Department of Computer ScienceUniversity of TorontoTorontoCanada

Personalised recommendations