Efficient numerical solution of Neumann problems on complicated domains (Q879746): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10092-006-0118-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001264023 / rank
 
Normal rank

Revision as of 22:54, 19 March 2024

scientific article
Language Label Description Also known as
English
Efficient numerical solution of Neumann problems on complicated domains
scientific article

    Statements

    Efficient numerical solution of Neumann problems on complicated domains (English)
    0 references
    0 references
    0 references
    0 references
    9 May 2007
    0 references
    The authors considered elliptic partial differential equations with Neumann boundary conditions on complicated domains. The discretization is performed by composite finite elements and the approximation propriety is studied. The convergence analysis for composite finite element discretization is based on the quasi-optimality of the Galerkin discretization and transformed as usual to an estimate of the interpolation error. Some numerical experiments are presented to illustrate the convergence behaviour of the multi-grid method on composite finite elements for a Neumann problem on the complicated domain of the Baltic Sea.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    oceanography
    0 references
    error bounds
    0 references
    0 references