Approximate multiplication in adaptive wavelet methods (Q352734)

From MaRDI portal





scientific article; zbMATH DE number 6184553
Language Label Description Also known as
default for all languages
No label defined
    English
    Approximate multiplication in adaptive wavelet methods
    scientific article; zbMATH DE number 6184553

      Statements

      Approximate multiplication in adaptive wavelet methods (English)
      0 references
      0 references
      0 references
      5 July 2013
      0 references
      The authors present a new approximate matrix-vector multiplication which better utilizes actual decay of the entries in the wavelet stiffness matrix and in the vector. It is shown that this multiplication algorithm is asymptotically optimal in the sense that storage and number of floating point operations remain proportional to the problem size. For some wavelet stiffness matrices, the new multiplication technique is compared with corresponding techniques of \textit{A. Cohen}, \textit{W. Dahmen}, and \textit{R. DeVore} [Math. Comput. 70, No. 233, 27--75 (2001; Zbl 0980.65130)] and of \textit{T. J. Dijkema}, \textit{C. Schwab}, and \textit{R. Stevenson} [Constr. Approx. 30, No. 3, 423--455 (2009; Zbl 1205.65313)].
      0 references
      adaptive wavelet method
      0 references
      Galerkin method
      0 references
      wavelet stiffness matrix
      0 references
      approximate matrix-vector multiplication
      0 references
      decay of matrix entries
      0 references
      quasi-sparse matrix
      0 references
      algorithm
      0 references

      Identifiers