Displaying similar documents to “Generalizations of the Finite Element Method”

A special finite element method based on component mode synthesis

Ulrich L. Hetmaniuk, Richard B. Lehoucq (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

The goal of our paper is to introduce basis functions for the finite element discretization of a second order linear elliptic operator with rough or highly oscillating coefficients. The proposed basis functions are inspired by the classic idea of component mode synthesis and exploit an orthogonal decomposition of the trial subspace to minimize the energy. Numerical experiments illustrate the effectiveness of the proposed basis functions.

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...

H P -finite element approximations on non-matching grids for partial differential equations with non-negative characteristic form

Andrea Toselli (2003)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

We propose and analyze a domain decomposition method on non-matching grids for partial differential equations with non-negative characteristic form. No weak or strong continuity of the finite element functions, their normal derivatives, or linear combinations of the two is imposed across the boundaries of the subdomains. Instead, we employ suitable bilinear forms defined on the common interfaces, typical of discontinuous Galerkin approximations. We prove an error bound which is optimal...

On FE-grid relocation in solving unilateral boundary value problems by FEM

Jaroslav Haslinger, Pekka Neittaanmäki, Kimmo Salmenjoki (1992)

Applications of Mathematics

Similarity:

We consider FE-grid optimization in elliptic unilateral boundary value problems. The criterion used in grid optimization is the total potential energy of the system. It is shown that minimization of this cost functional means a decrease of the discretization error or a better approximation of the unilateral boundary conditions. Design sensitivity analysis is given with respect to the movement of nodal points. Numerical results for the Dirichlet-Signorini problem for the Laplace equation...

A unified analysis of elliptic problems with various boundary conditions and their approximation

Jérôme Droniou, Robert Eymard, Thierry Gallouët, Raphaèle Herbin (2020)

Czechoslovak Mathematical Journal

Similarity:

We design an abstract setting for the approximation in Banach spaces of operators acting in duality. A typical example are the gradient and divergence operators in Lebesgue-Sobolev spaces on a bounded domain. We apply this abstract setting to the numerical approximation of Leray-Lions type problems, which include in particular linear diffusion. The main interest of the abstract setting is to provide a unified convergence analysis that simultaneously covers (i) all usual boundary conditions,...