BIT Numerical Mathematics

, Volume 39, Issue 3, pp 417–438 | Cite as

Bounds for the Entries of Matrix Functions with Applications to Preconditioning

  • Michele Benzi
  • Gene H. Golub


Let A be a symmetric matrix and let f be a smooth function defined on an interval containing the spectrum of A. Generalizing a well-known result of Demko, Moss and Smith on the decay of the inverse we show that when A is banded, the entries of f(A)are bounded in an exponentially decaying manner away from the main diagonal. Bounds obtained by representing the entries of f(A)in terms of Riemann-Stieltjes integrals and by approximating such integrals by Gaussian quadrature rules are also considered. Applications of these bounds to preconditioning are suggested and illustrated by a few numerical examples.

Matrix functions quadrature rules Lanczos process band matrices exponential decay preconditioned conjugate gradients 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    O. Axelsson, Iterative Solution Methods, Cambridge University Press, Cambridge, 1994.Google Scholar
  2. 2.
    O. Axelsson and B. Polman, On approximate factorization methods for block matrices suitable for vector and parallel processors, Linear Algebra Appl., 77 (1986), pp. 3–26.Google Scholar
  3. 3.
    Z. Bai, M. Fahey, and G. H. Golub, Some large-scale matrix computation problems, J. Comput. Appl. Math., 74 (1996), pp. 71–89.Google Scholar
  4. 4.
    Z. Bai and G. H. Golub, Bounds for the trace of the inverse and the determinant of symmetric positive definite matrices, Ann. Numer. Math., 4 (1997), pp. 29–38.Google Scholar
  5. 5.
    M. Benzi and G. H. Golub, Bounds for the entries of matrix functions with applications to preconditioning, Stanford University Report SCCM–98–04, February 1998.Google Scholar
  6. 6.
    M. Benzi, C. D. Meyer, Jr., and M. Tůma, A sparse approximate inverse preconditioner for the conjugate gradient method, SIAM J. Sci. Comput., 17 (1996), pp. 1135–1149.Google Scholar
  7. 7.
    S. N. Bernstein, Leçons sur les Propriétés Extrémales et la Meilleure Approximation des Fonctions Analytiques d'une Variable Réelle, Gauthier-Villars, Paris, 1926.Google Scholar
  8. 8.
    P. Castillo and Y. Saad, Preconditioning the matrix exponential operator with applications, University of Minnesota Supercomputing Institute Technical Report UMSI 97/142, Minneapolis, MN, 1997.Google Scholar
  9. 9.
    R. H. Chan and G. Strang, Toeplitz equations by conjugate gradients with circulant preconditioner, SIAM J. Sci. Stat. Comput., 10 (1989), pp. 104–119.Google Scholar
  10. 10.
    T. Chan, An optimal circulant preconditioner for Toeplitz systems, SIAM J. Sci. Stat. Comput., 9 (1998), pp. 766–771.Google Scholar
  11. 11.
    E. Chow and Y. Saad, Approximate inverse preconditioners via sparse-sparse iterations, SIAM J. Sci. Comput., 19 (1998), pp. 995–1023.Google Scholar
  12. 12.
    P. Concus, G. H. Golub, and G. Meurant, Block preconditioning for the conjugate gradient method, SIAM J. Sci. Stat. Comput., 6 (1985), pp. 220–252.Google Scholar
  13. 13.
    P. Concus and G. Meurant, On computing INV block preconditionings for the conjugate gradient method, BIT, 26 (1986), pp. 493–504.Google Scholar
  14. 14.
    P. J. Davis and P. Rabinowitz, Methods of Numerical Integration, 2nd ed., Academic Press, New York, 1984.Google Scholar
  15. 15.
    G. Dahlquist, S. C. Eisenstat and G. H. Golub, Bounds for the error of linear systems using the theory of moments, J. Math. Anal. Appl., 37 (1972), pp. 151–166.Google Scholar
  16. 16.
    G. Dahlquist, G. H. Golub, and S. G. Nash, Bounds for the error in linear systems, in Proceedings of the Workshop on Semi-Infinite Programming, R. Hettich, ed., Springer-Verlag, New York, 1978, pp. 154–172.Google Scholar
  17. 17.
    S. Demko, Inverses of band matrices and local convergence of spline projections, SIAM J. Numer. Anal., 14 (1977), pp. 616–619.Google Scholar
  18. 18.
    S. Demko, W. F. Moss, and P. W. Smith, Decay rates for inverses of band matrices, Math. Comp., 43 (1984), pp. 491–499.Google Scholar
  19. 19.
    V. L. Druskin and L. A. Knizhnerman, Two polynomial methods of calculating functions of symmetric matrices, USSR Comput. Maths. Math. Phys., 29 (1989), pp. 112–121.Google Scholar
  20. 20.
    M. Fiedler and H. Schneider, Analytic functions of M-matrices and generalizations, Linear and Multilinear Algebra, 13 (1983), pp. 185–201.Google Scholar
  21. 21.
    F. R. Gantmacher, The Theory of Matrices, Vol. I, Chelsea, New York, 1959.Google Scholar
  22. 22.
    G. H. Golub, Some uses of the Lanczos algorithm in numerical linear algebra, in Topics in Numerical Analysis, J. H. Miller, ed., Academic Press, New York, 1973, pp. 173–184.Google Scholar
  23. 23.
    G. H. Golub, Bounds for matrix moments, Rocky Mountain J. Math., 4 (1974), pp. 207–211.Google Scholar
  24. 24.
    G. H. Golub and G. Meurant, Matrices, moments and quadratures, in Numerical Analysis 1993, D. F. Griffiths and G. A. Watson, eds., Pitman Research Notes in Mathematics, Vol. 303, Essex, England, 1994, pp. 105–156.Google Scholar
  25. 25.
    G. H. Golub and G. Meurant, Matrices, moments and quadratures II; how to compute the norm of the error in iterative methods, BIT, 37 (1997), pp. 687–705.Google Scholar
  26. 26.
    G. H. Golub and Z. Strakoš, Estimates in quadratic formulas, Numer. Algorithms, 8 (1994), pp. 241–268.Google Scholar
  27. 27.
    G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, 1996.Google Scholar
  28. 28.
    G. H. Golub and U. von Matt, Quadratically constrained least squares and quadratic problems, Numer. Math., 59 (1991), pp. 561–580.Google Scholar
  29. 29.
    G. H. Golub and J. H. Welsh, Calculation of Gauss quadrature rules, Math. Comp., 23 (1969), pp. 221–230.Google Scholar
  30. 30.
    M. Grote and T. Huckle, Parallel preconditioning with sparse approximate inverses, SIAM J. Sci. Comput., 18 (1997), pp. 838–853.Google Scholar
  31. 31.
    L. A. Knizhnerman, The simple Lanczos procedure: estimates of the error of the Gauss quadrature formula and their applications, Comput. Math. Math. Phys., 36 (1996), pp. 1481–1492.Google Scholar
  32. 32.
    L. Yu. Kolotilina and A. Yu. Yeremin, Factorized sparse approximate inverse preconditionings I. Theory, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 45–58.Google Scholar
  33. 33.
    L. Yu. Kolotilina and A. Yu. Yeremin, On a family of two-level preconditionings of the incomplete block factorization type, Sov. J. Numer. Anal. Math. Modelling, 1 (1986), pp. 293–320.Google Scholar
  34. 34.
    G. Meinardus, Approximation of Functions: Theory and Numerical Methods, Springer-Verlag, New York, 1967.Google Scholar
  35. 35.
    G. Meurant, A review on the inverse of symmetric tridiagonal and block tridiagonal matrices, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 707–728.Google Scholar
  36. 36.
    P. D. Robinson and A. Wathen, Variational bounds on the entries of the inverse of a matrix, IMA J. Numer. Anal., 12 (1992), pp. 463–486.Google Scholar
  37. 37.
    Y. Saad, Iterative Methods for Sparse Linear Systems, PWS Publishing, Boston, 1996.Google Scholar
  38. 38.
    G. Strang, A proposal for Toeplitz matrix calculations, Stud. Appl.Math., 74 (1986), pp. 171–176.Google Scholar
  39. 39.
    R. S. Varga, Nonnegatively posed problems and completely monotonic functions, Linear Algebra Appl., 1 (1968), pp. 329–347.Google Scholar
  40. 40.
    H. A. van der Vorst, An iterative solution method for solving f(A)x = b, using Krylov subspace information obtained for the symmetric positive definite matrix A, J. Comput. Appl. Math., 18 (1987), pp. 249–263.Google Scholar

Copyright information

© Swets & Zeitlinger 1999

Authors and Affiliations

  • Michele Benzi
    • 1
  • Gene H. Golub
    • 2
  1. 1.Scientific Computing Group, CIC-19Los Alamos National LaboratoryLos AlamosUSA. email:
  2. 2.Department of Computer ScienceStanford UniversityStanfordUSA. email:

Personalised recommendations