Numerical Algorithms

, Volume 40, Issue 2, pp 125–135 | Cite as

Solving linear systems using wavelet compression combined with Kronecker product approximation



Discrete wavelet transform approximation is an established means of approximating dense linear systems arising from discretization of differential and integral equations defined on a one-dimensional domain. For higher dimensional problems, approximation with a sum of Kronecker products has been shown to be effective in reducing storage and computational costs. We have combined these two approaches to enable solution of very large dense linear systems by an iterative technique using a Kronecker product approximation represented in a wavelet basis. Further approximation of the system using only a single Kronecker product provides an effective preconditioner for the system. Here we present our methods and illustrate them with some numerical examples. This technique has the potential for application in a range of areas including computational fluid dynamics, elasticity, lubrication theory and electrostatics.


Kronecker product wavelets dense matrices preconditioning 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. Beylkin and M.J. Mohlenkamp, Numerical operator calculus in higher dimensions, Proc. Natl. Acad. Sci. USA 99(16) (2002) 10246–10251. CrossRefPubMedGoogle Scholar
  2. [2]
    T.F. Chan and K. Chen, On two variants of an algebraic wavelet preconditioner, SIAM J. Sci. Comput. 24(1) (2002) 260–283. CrossRefGoogle Scholar
  3. [3]
    T.F. Chan, W.P. Tang and W.L. Wan, Wavelet sparse approximate inverse preconditioners, BIT 37 (1997) 644–660. Google Scholar
  4. [4]
    K. Chen, Discrete wavelet transforms accelerated sparse preconditioners for dense boundary element systems, Elec. Trans. Numer. Anal. 8 (1999) 138–153. Google Scholar
  5. [5]
    J. Ford and K. Chen, Wavelet-based preconditioners for dense matrices with non-smooth local features, BIT 41(2) (2001) 282–307. CrossRefGoogle Scholar
  6. [6]
    J. Ford, K. Chen and L. Scales, A new wavelet transform preconditioner for iterative solution of elastohydrodynamic lubrication problems, Internat. J. Comput. Math. 75 (2000) 497–513. Google Scholar
  7. [7]
    J.M. Ford, An improved DWT-based preconditioner for dense matrix problems, Numerical Analysis Report No. 412, Manchester Centre for Computational Mathematics (September 2002). Google Scholar
  8. [8]
    J.M. Ford, A black box at the end of the rainbow: searching for the perfect preconditioner, Philos. Trans. Roy. Soc. London A 361(1813) (2003) 2665–2680. CrossRefGoogle Scholar
  9. [9]
    J.M. Ford, I.V. Oseledets and E.E. Tyrtyshnikov, Matrix approximations and solvers using tensor products and non-standard wavelet transforms related to irregular grids, Russian J. Numer. Anal. Math. Modelling 19(2) (2004) 185–204. CrossRefGoogle Scholar
  10. [10]
    J.M. Ford and E.E. Tyrtyshnikov, Combining Kronecker product approximation with discrete wavelet transforms to solve dense, function-related linear systems, SIAM J. Sci. Comput. 25(3) (2003) 961–981. CrossRefGoogle Scholar
  11. [11]
    S.A. Goreinov and E.E. Tyrtyshnikov, The maximal-volume concept in approximation by low-rank matrices, Contemporary Math. 208 (2001) 47–51. Google Scholar
  12. [12]
    S.A. Goreinov, E.E. Tyrtyshnikov and N.L. Zamarashkin, A theory of pseudo-skeleton approximations, Linear Algebra Appl. 261 (1997) 1–21. Google Scholar
  13. [13]
    I.V. Oseledets, Application of B-splines and divided differences for construction of fast discrete wavelet transforms on irregular grids, Math. Notes (2004) in press. Google Scholar
  14. [14]
    I.V. Oseledets and E.E. Tyrtyshnikov, Approximate inversion of matrices with solution of the hypersingular integral equation, J. Comput. Math. and Math. Physics (2004) to appear. Google Scholar
  15. [15]
    E.E. Tyrtyshnikov, Mosaic-skeleton approximations, Calcolo 33 (1996) 47–57. Google Scholar
  16. [16]
    E.E. Tyrtyshnikov, Incomplete cross approximation in the mosaic-skeleton method, Computing 64(4) (2000) 367–380. CrossRefGoogle Scholar
  17. [17]
    E.E. Tyrtyshnikov, Tensor approximations of matrices associated with asymptotically smooth functions, Sbornik Math. 194(6) (2003) 147–160. Google Scholar
  18. [18]
    E.E. Tyrtyshnikov, Kronecker-product approximations for some function-related matrices, Linear Algebra Appl. 379 (2004) 423–437. CrossRefGoogle Scholar
  19. [19]
    C. Van Loan, The ubiquitous Kronecker product, J. Comput. Appl. Math. 123(1/2) (2000) 85–100. CrossRefGoogle Scholar
  20. [20]
    C. Van Loan and N.P. Pitsianis, Approximation with Kronecker products, in: Linear Algebra for Large Scale and Real Time Applications, eds. M.S. Moonen and G.H. Golub (Kluwer, Dordrecht, 1993) pp. 293–314. Google Scholar

Copyright information

© Springer 2005

Authors and Affiliations

  1. 1.Department of MathematicsUMISTManchesterUK
  2. 2.Institute of Numerical Mathematics, Russian Academy of SciencesMoscowRussia

Personalised recommendations