Publication

Discrete maximum principle for Galerkin approximations of the Laplace operator on arbitrary meshes

2004
Journal Articles

Abstract

We derive a nonlinear stabilized Galerkin approximation of the Laplace operator for which we prove a discrete maximum principle on arbitrary meshes and for arbitrary space dimension without resorting to the well-known acute condition or generalizations thereof. We also prove the existence of a discrete solution and discuss the extension of the scheme to convection–diffusion–reaction equations. Finally, we present examples showing that the new scheme cures local minima produced by the standard Galerkin approach while maintaining first-order accuracy in the H1-norm.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2004
Journal Articles

Abstract

Official source

Related concepts (32)

Galerkin method

In mathematics, in the area of numerical analysis, Galerkin methods are named after the Soviet mathematician Boris Galerkin. They convert a continuous operator problem, such as a differential equation, commonly in a weak formulation, to a discrete problem by applying linear constraints determined by finite sets of basis functions.

Meshfree methods

In the field of numerical analysis, meshfree methods are those that do not require connection between nodes of the simulation domain, i.e. a mesh, but are rather based on interaction of each node with all its neighbors. As a consequence, original extensive properties such as mass or kinetic energy are no longer assigned to mesh elements but rather to the single nodes. Meshfree methods enable the simulation of some otherwise difficult types of problems, at the cost of extra computing time and programming effort.

Discrete Laplace operator

In mathematics, the discrete Laplace operator is an analog of the continuous Laplace operator, defined so that it has meaning on a graph or a discrete grid. For the case of a finite-dimensional graph (having a finite number of edges and vertices), the discrete Laplace operator is more commonly called the Laplacian matrix. The discrete Laplace operator occurs in physics problems such as the Ising model and loop quantum gravity, as well as in the study of discrete dynamical systems.