Efficient numerical solution of Neumann problems on complicated domains (Q879746)

From MaRDI portal





scientific article; zbMATH DE number 5151029
Language Label Description Also known as
default for all languages
No label defined
    English
    Efficient numerical solution of Neumann problems on complicated domains
    scientific article; zbMATH DE number 5151029

      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
      oceanography
      0 references
      error bounds
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references