We use wavelets for the discretisation of an integral equation. Upper bounds are derived for elements of the resulting matrix. These upper bounds are used to compute only those elements that may exceed a certain threshold. Numerical experiments are presented in which this manner of computing a sparse matrix is compared with computing the matrix in nodal basis, followed by a transformation and, for most comparisons, thresholding.
|Publisher||Department of Applied Mathematics, University of Twente|