- Fast evaluation of system matrices w.r.t. multi-tree collections of tensor product refinable basis functions
- Journal of Computational and Applied Mathematics
- Pages (from-to)
- Document type
- Faculty of Science (FNWI)
- Korteweg-de Vries Institute for Mathematics (KdVI)
An algorithm is presented that for a local bilinear form evaluates in linear complexity the application of the stiffness matrix w.r.t. a collection of tensor product multiscale basis functions, assuming that this collection has a multi-tree structure. It generalizes an algorithm for sparse-grid index sets [R. Balder, Ch. Zenger, The solution of multidimensional real Helmholtz equations on sparse grids, SIAM J. Sci. Comput. 17 (3) (1996) 631-646] and it finds its application in adaptive tensor product approximation methods.
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.