All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 17 Next

Displaying 321 – 340 of 374

Showing per page

Analysis of Compatible Discrete Operator schemes for elliptic problems on polyhedral meshes

Jérôme Bonelle, Alexandre Ern (2014)

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

Compatible schemes localize degrees of freedom according to the physical nature of the underlying fields and operate a clear distinction between topological laws and closure relations. For elliptic problems, the cornerstone in the scheme design is the discrete Hodge operator linking gradients to fluxes by means of a dual mesh, while a structure-preserving discretization is employed for the gradient and divergence operators. The discrete Hodge operator is sparse, symmetric positive definite and is...

Analysis of patch substructuring methods

Martin Gander, Laurence Halpern, Frédéric Magoulès, Francois Roux (2007)

International Journal of Applied Mathematics and Computer Science

Patch substructuring methods are non-overlapping domain decomposition methods like classical substructuring methods, but they use information from geometric patches reaching into neighboring subdomains condensated, on the interfaces to enhance the performance of the method, while keeping it non-overlapping. These methods are very convenient to use in practice, but their convergence properties have not been studied yet. We analyze geometric patch substructuring methods for the special case of one...

Analysis of the FEM and DGM for an elliptic problem with a nonlinear Newton boundary condition

Feistauer, Miloslav, Bartoš, Ondřej, Roskovec, Filip, Sändig, Anna-Margarete (2017)

Proceedings of Equadiff 14

The paper is concerned with the numerical analysis of an elliptic equation in a polygon with a nonlinear Newton boundary condition, discretized by the finite element or discontinuous Galerkin methods. Using the monotone operator theory, it is possible to prove the existence and uniqueness of the exact weak solution and the approximate solution. The main attention is paid to the study of error estimates. To this end, the regularity of the weak solution is investigated and it is shown that due to...

Analysis of two-level domain decomposition preconditioners based on aggregation

Marzio Sala (2004)

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

In this paper we present two-level overlapping domain decomposition preconditioners for the finite-element discretisation of elliptic problems in two and three dimensions. The computational domain is partitioned into overlapping subdomains, and a coarse space correction is added. We present an algebraic way to define the coarse space, based on the concept of aggregation. This employs a (smoothed) aggregation technique and does not require the introduction of a coarse grid. We consider a set of assumptions...

Analysis of two-level domain decomposition preconditioners based on aggregation

Marzio Sala (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

In this paper we present two-level overlapping domain decomposition preconditioners for the finite-element discretisation of elliptic problems in two and three dimensions. The computational domain is partitioned into overlapping subdomains, and a coarse space correction is added. We present an algebraic way to define the coarse space, based on the concept of aggregation. This employs a (smoothed) aggregation technique and does not require the introduction of a coarse grid. We consider a...

Anisotropic interpolation error estimates via orthogonal expansions

Mingxia Li, Shipeng Mao (2013)

Open Mathematics

We prove anisotropic interpolation error estimates for quadrilateral and hexahedral elements with all possible shape function spaces, which cover the intermediate families, tensor product families and serendipity families. Moreover, we show that the anisotropic interpolation error estimates hold for derivatives of any order. This goal is accomplished by investigating an interpolation defined via orthogonal expansions.

Currently displaying 321 – 340 of 374