Displaying similar documents to “Meshless Polyharmonic Div-Curl Reconstruction”

Greedy Algorithms for Adaptive Approximation

Albert Cohen (2009)

Bollettino dell'Unione Matematica Italiana

Similarity:

We discuss the performances of greedy algorithms for two problems of numerical approximation. The first one is the best approximation of an arbitrary function by an N-terms linear combination of simple functions adaptively picked within a large dictionary. The second one is the approximation of an arbitrary function by a piecewise polynomial function on an optimally adapted triangulation of cardinality N. Performance is measured in terms of convergence rate with respect to the number...

Approximation of the arch problem by residual-free bubbles

A. Agouzal, M. El Alami El Ferricha (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We consider a general loaded arch problem with a small thickness. To approximate the solution of this problem, a conforming mixed finite element method which takes into account an approximation of the middle line of the arch is given. But for a very small thickness such a method gives poor error bounds. the conforming Galerkin method is then enriched with residual-free bubble functions.