Discretization of elliptic differential equations on curvilinear bounded domains with sparse grids (Q1913347)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Discretization of elliptic differential equations on curvilinear bounded domains with sparse grids
scientific article

    Statements

    Discretization of elliptic differential equations on curvilinear bounded domains with sparse grids (English)
    0 references
    0 references
    0 references
    0 references
    4 September 1996
    0 references
    The authors consider the approximation of the weak solutions of some linear elliptic partial differential equation using finite elements on sparse grids. They construct some sparse grid finite element spaces, an interpolation theory on sparse grids and a discretization algorithm for sparse grids using grid generation by transformation. They take into acocunt curvilinear bounded domains. The numerical results for some examples show a very good convergence in the discrete \(L^2\) norm although the boundary of the domain has a ``bad'' shape (reentrant corners, for example).
    0 references
    reentrant corners
    0 references
    weak solutions
    0 references
    finite elements
    0 references
    sparse grid
    0 references
    algorithm
    0 references
    grid generation
    0 references
    curvilinear bounded domains
    0 references
    numerical results
    0 references
    convergence
    0 references

    Identifiers

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