Displaying similar documents to “The discrete compactness property for anisotropic edge elements on polyhedral domains”

The discrete compactness property for anisotropic edge elements on polyhedral domains

Ariel Luis Lombardi (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We prove the discrete compactness property of the edge elements of any order on a class of anisotropically refined meshes on polyhedral domains. The meshes, made up of tetrahedra, have been introduced in [Th. Apel and S. Nicaise, (1998) 519–549]. They are appropriately graded near singular corners and edges of the polyhedron.

Anisotropic mesh refinement in polyhedral domains: error estimates with data in L2(Ω)

Thomas Apel, Ariel L. Lombardi, Max Winkler (2014)

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

Similarity:

The paper is concerned with the finite element solution of the Poisson equation with homogeneous Dirichlet boundary condition in a three-dimensional domain. Anisotropic, graded meshes from a former paper are reused for dealing with the singular behaviour of the solution in the vicinity of the non-smooth parts of the boundary. The discretization error is analyzed for the piecewise linear approximation in the ()- and ()-norms by using a new quasi-interpolation...

On the second-order convergence of a function reconstructed from finite volume approximations of the Laplace equation on Delaunay-Voronoi meshes

Pascal Omnes (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

Cell-centered and vertex-centered finite volume schemes for the Laplace equation with homogeneous Dirichlet boundary conditions are considered on a triangular mesh and on the Voronoi diagram associated to its vertices. A broken function is constructed from the solutions of both schemes. When the domain is two-dimensional polygonal convex, it is shown that this reconstruction converges with second-order accuracy towards the exact solution in the  norm, under...

On the second-order convergence of a function reconstructed from finite volume approximations of the Laplace equation on Delaunay-Voronoi meshes

Pascal Omnes (2011)

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

Similarity:

Cell-centered and vertex-centered finite volume schemes for the Laplace equation with homogeneous Dirichlet boundary conditions are considered on a triangular mesh and on the Voronoi diagram associated to its vertices. A broken function is constructed from the solutions of both schemes. When the domain is two-dimensional polygonal convex, it is shown that this reconstruction converges with second-order accuracy towards the exact solution in the  norm,...

Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP

Edith Hemaspaandra, Jörg Rothe, Holger Spakowski (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of , where is a fixed rational number. Our main results are that these problems are complete for the class of problems solvable parallel access to NP. To achieve these main results, we also show that the restriction of the vertex cover problem...

Interface model coupling via prescribed local flux balance

Annalisa Ambroso, Christophe Chalons, Frédéric Coquel, Thomas Galié (2014)

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

Similarity:

This paper deals with the non-conservative coupling of two one-dimensional barotropic Euler systems at an interface at = 0. The closure pressure laws differ in the domains < 0 and > 0, and a Dirac source term concentrated at = 0 models singular pressure losses. We propose two numerical methods. The first one relies on ghost state reconstructions at the interface while the second is based on a suitable relaxation framework. Both methods satisfy a well-balanced property...

Edge-based a Posteriori Error Estimators for Generating Quasi-optimal Simplicial Meshes

A. Agouzal, K. Lipnikov, Yu. Vassilevsk (2010)

Mathematical Modelling of Natural Phenomena

Similarity:

We present a new method for generating a -dimensional simplicial mesh that minimizes the -norm, > 0, of the interpolation error or its gradient. The method uses edge-based error estimates to build a tensor metric. We describe and analyze the basic steps of our method

Convex shape optimization for the least biharmonic Steklov eigenvalue

Pedro Ricardo Simão Antunes, Filippo Gazzola (2013)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

The least Steklov eigenvalue for the biharmonic operator in bounded domains gives a bound for the positivity preserving property for the hinged plate problem, appears as a norm of a suitable trace operator, and gives the optimal constant to estimate the -norm of harmonic functions. These applications suggest to address the problem of minimizing in suitable classes of domains. We survey the existing results and conjectures about this topic;...