scientific article; zbMATH DE number 1072439
In the course of solving partial differential equations using wavelet bases, one often has to multiply two functions given by their wavelet representations. This problem can be reduced to computing the square of functions. The computational complexity of a straightforward algorithm for performing \(u^2\) is \({\mathcal O}(N^3)\), where \(N\) is the number of significant wavelet coefficients of the function \(u\). The paper contains a \({\mathcal O}(N)\) algorithm for this problem, which is based on uncoupling the interaction between the scales in the wavelet representation. The algorithm is discussed separately for Haar wavelets and for the general case. For the entire collection see [Zbl 0841.00017].
- On the adaptive numerical solution of nonlinear partial differential equations in wavelet bases
- The fuzzy rule-base solution of differential equations
- A fast adaptive wavelet collocation algorithm for multidimensional PDEs
- Efficient multi-scale computation of products of orbitals in electronic structure calculations
- scientific article; zbMATH DE number 1950369 (Why is no real title available?)
- Wavelet methods in computational combustion
- One topic on wavelet algorithm by using one dimensional Haar wavelets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359335)
