WIAS Preprint No. 434, (1998)

Piecewise Linear Wavelet Collocation on Triangular Grids, Approximation of the Boundary Manifold and Quadrature


  • Ehrich, Sven
  • Rathsfeld, Andreas
    ORCID: 0000-0002-2029-5761

2010 Mathematics Subject Classification

  • 65N38 45L10 65R20


  • pseudo-differential equation of order 0 and -1, piecewise linear collocation, wavelet algorithm, approximation of parametrization, quadrature




In this paper we consider a piecewise linear collocation method for the solution of a pseudo-differential equations of order r = 0,-1 over a closed and smooth boundary manifold. The trial space is the space of all continuous and piecewise linear functions defined over a uniform triangular grid and the collocation points are the grid points. For the wavelet basis in the trial space we choose the three-point hierarchical basis together with a slight modification near the boundary points of the global patches of parametrization. We choose three, four, and six term linear combinations of Dirac delta functionals as wavelet basis in the space of test functionals. Though not all wavelets have vanishing moments, we derive the usual compression results, i.e. we prove that, for N degrees of freedom, the fully populated stiffness matrix of N2 entries can be approximated by a sparse matrix with no more than O(N [log N]2.25) non-zero entries. The main topic of the present paper, however, is to show that the parametrization can be approximated by low order piecewise polynomial interpolation and that the integrals in the stiffness matrix can be computed by quadrature, where the quadrature rules are combinations of product integration applied to non analytic factors of the integrand and of high order Gauß rules applied to the analytic parts. The whole algorithm for the assembling of the matrix requires no more than O(N [log N]4.25) arithmetic operations, and the error of the collocation approximation, including the compression, the approximative parametrization, and the quadratures, is less than O(N-1[log N]2). Note that, in contrast to well-known algorithms by v.Petersdorff, Schwab, and Schneider, only a finite degree of smoothness is required.

Appeared in

  • Electronic Transaction on Numerical Analysis 12, 2001, pp. 149-192

Download Documents