Skip to main content
Log in

A framework for polynomial preconditioners based on fast transforms I: Theory

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Optimal and superoptimal approximations of a complex square matrix by polynomials in a normal basis matrix are considered. If the unitary transform associated with the eigenvectors of the basis matrix is computable using a fast algorithm, the approximations may be utilized for constructing preconditioners. Theorems describing how the parameters of the approximations could be efficiently computed are given, and for special cases earlier results by other authors are recovered. Also, optimal and superoptimal approximations for block matrices are determined, and the same type of theorems as for the point case are proved.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. G. S. Ammar and W. B. Gragg,Superfast solution of real positive definite Toeplitz systems, SIAM J. Matrix Anal. Appl., 9 (1988), pp. 61–76

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Bini and F. Di Benedetto,A new preconditioner for the parallel solution of positive definite Teoplitz systems, in Proc. Second ACM Symp. on Parallel Algorithms and Architectures, ACM Press, New York, 1990, pp. 220–223.

    Chapter  Google Scholar 

  3. D. Bini and P. Favati,On a matrix algebra related to the discrete Hartley transform, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 500–507.

    Article  MATH  MathSciNet  Google Scholar 

  4. E. Boman and I. Koltracht,Fast transform based preconditioners for Toeplitz equations, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 628–645.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. H. Chan and T. F. Chan,Circulant preconditioners for elliptic problems, J. Numer. Linear Algebra Appl., 1 (1992), pp. 77–101.

    MathSciNet  Google Scholar 

  6. R. H. Chan and M. K. Ng,Conjugate gradient methods for Toeplitz systems, SIAM Rev., 38 (1996), pp. 427–482.

    Article  MATH  MathSciNet  Google Scholar 

  7. R. H. Chan, M. K. Ng, and C.-K. Wong,Sine transform based preconditioners for symmetric Toeplitz systems, Linear Algebra Appl., 232 (1996), pp. 237–259.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. H. Chan and C.-K. Wong,Sine transform based preconditioners for elliptic problems, Numer. Linear Algebra Appl., 4 (1997), pp. 351–368.

    Article  MATH  MathSciNet  Google Scholar 

  9. T. F. Chan,An optimal circulant preconditioner for Toeplitz systems, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 766–771.

    Article  MATH  MathSciNet  Google Scholar 

  10. F. de Hoog,A new algorithm for solving Toeplitz systems of equations, Linear Algebra Appl., 88/89, (1987), pp. 123–138.

    Article  Google Scholar 

  11. F. Di Benedetto,Analysis of preconditioning techniques for ill-conditioned Toeplitz matrices, SIAM J. Sci. Comput., 16 (1995), pp. 682–697.

    Article  MATH  MathSciNet  Google Scholar 

  12. F. Di Benedetto,Preconditioning of block Toeplitz matrices, by sine transforms, SIAM J. Sci. Comput., 18 (1997), pp. 499–515.

    Article  MATH  MathSciNet  Google Scholar 

  13. F. Di Benedetto and S. Serra Capizzano,A unifying approach to abstract matrix algebra preconditioning, Numer. Math., to appear.

  14. G. Fiorentino and S. Serra,Fast parallel solvers for elliptic problems, Comput. Math. Appl., 32:2 (1996), pp. 61–68.

    Article  MATH  MathSciNet  Google Scholar 

  15. U. Grenander and G. Szegő,Toeplitz Forms and Their Applications, 2nd ed., Chelsea, New York, 1984.

    MATH  Google Scholar 

  16. G. Heinig and P. Jankowski,Parallel and superfast algorithms for Hankel systems of equations, Numer. Math., 58 (1990), pp. 109–127.

    Article  MATH  MathSciNet  Google Scholar 

  17. L. Hemmingsson,A fast modified sine transform for solving block-tridiagonal systems with Toeplitz blocks, Numer. Algorithms, 7 (1994), pp. 375–389.

    Article  MATH  MathSciNet  Google Scholar 

  18. L. Hemmingsson,Toeplitz preconditioners with block structure for first-order PDEs, Numer. Linear Algebra Appl., 3 (1996), pp. 21–44.

    Article  MATH  MathSciNet  Google Scholar 

  19. L. Hemmingsson and K. Otto,Analysis of semi-Toeplitz preconditioners for first-order PDEs, SIAM J. Sci. Comput., 17 (1996), pp. 47–64.

    Article  MATH  MathSciNet  Google Scholar 

  20. S. Holmgren and K. Otto,A comparison of preconditioned iterative methods for nonsymmetric block-tridiagonal systems of equations, Report 123 (revised), Dept. of Scientific Computing, Uppsala Univ., Uppsala, Sweden, 1990.

    Google Scholar 

  21. S. Holmgren and K. Otto,Iterative solution methods and preconditioners for blocktridiagonal systems of equations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 863–886.

    Article  MATH  MathSciNet  Google Scholar 

  22. S. Holmgren and K. Otto,Semicirculant preconditioners for first-order partial differential equations, SIAM J. Sci. Comput., 15 (1994), pp. 385–407.

    Article  MATH  MathSciNet  Google Scholar 

  23. S. Holmgren and K. Otto,Semicirculant solvers and boundary corrections for firstorder partial differential equations, SIAM J. Sci. Comput., 17 (1996), pp. 613–630.

    Article  MATH  MathSciNet  Google Scholar 

  24. T. Huckle,Circulant and skewcirculant matrices for solving Toeplitz matrix problems, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 767–777.

    Article  MATH  MathSciNet  Google Scholar 

  25. T. Huckle,Fast transforms for tridiagonal linear equations, BIT, 34 (1994), pp. 99–112.

    Article  MATH  MathSciNet  Google Scholar 

  26. X.-Q. Jin,Hartley preconditioners for Toeplitz systems generated by positive continuous functions, BIT, 34 (1994), pp. 367–371.

    Article  MATH  MathSciNet  Google Scholar 

  27. X.-Q. Jin and R. H. Chan,Circulant preconditioners for second order hyperbolic equations, BIT, 32 (1992), pp. 650–664.

    Article  MATH  MathSciNet  Google Scholar 

  28. T. Kailath and V. Olshevsky,Displacement structure approach to discrete trigonometric transform based preconditioners of G. Strang and T. Chan types, Calcolo, 33 (1996), pp. 191–208.

    MATH  MathSciNet  Google Scholar 

  29. D. Pal and T. Kailath,Fast triangular factorization and inversion of Hankel and related matrices with arbitrary rank profile, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 451–478.

    Article  MATH  MathSciNet  Google Scholar 

  30. E. E. Tyrtyshnikov,Optimal and superoptimal circulant preconditioners, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 459–473.

    Article  MATH  MathSciNet  Google Scholar 

  31. E. E. Tyrtyshnikov,Circulant preconditioners with unbounded inverses, Linear Algebra Appl., 216 (1995), pp. 1–23.

    Article  MATH  MathSciNet  Google Scholar 

  32. C. F. Van Loan,Computational Frameworks for the Fast Fourier Transform, SIAM, Philadelphia, PA, 1992.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by Lars Eldén

This research was supported by the Swedish National Board for Industrial and Technical Development (NUTEK) and by the U.S. National Science Foundation under grant ASC-8958544.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Holmgren, S., Otto, K. A framework for polynomial preconditioners based on fast transforms I: Theory. Bit Numer Math 38, 544–559 (1998). https://doi.org/10.1007/BF02510259

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02510259

AMS subject classification

Key words

Navigation