A practical finite element approximation of a semi-definite Neumann problem on a curved domain (Q1822217): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:48, 5 March 2024

scientific article
Language Label Description Also known as
English
A practical finite element approximation of a semi-definite Neumann problem on a curved domain
scientific article

    Statements

    A practical finite element approximation of a semi-definite Neumann problem on a curved domain (English)
    0 references
    0 references
    0 references
    1987
    0 references
    In this very interesting paper the authors consider a finite element approximation of the semi-definite Neumann problem: \(-\nabla \cdot (\sigma \nabla u)=f\) in a curved domain \(\Omega \subset {\mathbb{R}}^ n\) \((n=2\) or 3), \(\sigma (\partial u/\partial v)=g\) on \(\partial \Omega\) and \(\int_{\Omega}udx=q\), a given constant, for data f and g satisfying the compatibility condition \(\int_{\Omega}fdx+\int_{\partial \Omega}gds=0\). Due to perturbation of domain errors \((\Omega \to \Omega^ h)\) the standard Galerkin approximation to the above problem may not have a solution. A remedy is to perturb the right hand side so that a discrete form of the compatibility condition holds. The authors show that for a finite element space defined over \(D^ h\), a union of elements, with approximation power \(h^ k\) in the \(L^ 2\) norm and with \(dist(\Omega,\Omega^ h)\leq Ch^ k\), one obtains optimal rates of convergence in the \(H^ 1\) and \(L^ 2\) norms whether \(\Omega^ h\) is fitted \((\Omega^ h\equiv D^ h)\) or unfitted \((\Omega^ h\subset D^ h)\) provided the numerical integration scheme has sufficient accuracy.
    0 references
    finite element
    0 references
    semi-definite Neumann problem
    0 references
    Galerkin approximation
    0 references
    compatibility condition
    0 references
    optimal rates of convergence
    0 references

    Identifiers