The discrete maximum principle for Galerkin solutions of elliptic problems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F12%3A00370385" target="_blank" >RIV/67985840:_____/12:00370385 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.2478/s11533-011-0085-0" target="_blank" >http://dx.doi.org/10.2478/s11533-011-0085-0</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.2478/s11533-011-0085-0" target="_blank" >10.2478/s11533-011-0085-0</a>

Result language
angličtina
Original language name
The discrete maximum principle for Galerkin solutions of elliptic problems
Original language description
This paper provides an equivalent characterization of the discrete maximum principle for Galerkin solutions of general linear elliptic problems. The characterization is formulated in terms of the discrete Green?s function and the elliptic projection of the boundary data. This general concept is applied to the analysis of the discrete maximum principle for the higher-order finite elements in one-dimension and to the lowest-order finite elements on simplices of arbitrary dimension. The paper surveys the state of the art in the field of the discrete maximum principle and provides new generalizations of several results.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/IAA100760702" target="_blank" >IAA100760702: Methods of higher order of accuracy for solution of multi-physics coupled problems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)