Greedy Algorithms and Best m-Term Approximation with Respect to Biorthogonal Systems.
We extend results on constructing semiorthogonal linear spline prewavelet systems in one and two dimensions to the case of irregular dyadic refinement. In the one-dimensional case, we obtain sharp two-sided inequalities for the -condition, 1 < p < ∞, of such systems.
By re-examining the arguments and counterexamples in I. Babuška, A. K. Aziz (1976) concerning the well-known maximum angle condition, we study the convergence behavior of the linear finite element method (FEM) on a family of distorted triangulations of the unit square originally introduced by H. Schwarz in 1880. For a Poisson problem with polynomial solution, we demonstrate arbitrarily slow convergence as well as failure of convergence if the distortion of the triangulations grows sufficiently fast....
Compared to conforming P1 finite elements, nonconforming P1 finite element discretizations are thought to be less sensitive to the appearance of distorted triangulations. E.g., optimal-order discrete norm best approximation error estimates for functions hold for arbitrary triangulations. However, the constants in similar estimates for the error of the Galerkin projection for second-order elliptic problems show a dependence on the maximum angle of all triangles in the triangulation. We demonstrate...
Page 1