Approximation on partially ordered sets of regular grids (Q1369211): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4358723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Development of semi-coarsening techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Semicoarsening Multigrid Algorithm for SIMD Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel Gauss-Seidel-algorithms for full and sparse grid problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous and Discrete Wavelet Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse-grid finite-volume multigrid for \(3D\)-problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4366627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A high-resolution Euler solver based on multigrid, semi-coarsening, and defect correction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semicoarsening Multigrid on a Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3476450 / rank
 
Normal rank

Revision as of 18:21, 27 May 2024

scientific article
Language Label Description Also known as
English
Approximation on partially ordered sets of regular grids
scientific article

    Statements

    Approximation on partially ordered sets of regular grids (English)
    0 references
    0 references
    0 references
    5 March 1998
    0 references
    The approximation of functions on partially ordered sets of regular grids (on a grid of grids) is studied. Minimal requirements that are needed to introduce the necessary grid transfer operators are determined. An analysis of these requirements results in the introduction of a hierarchical decomposition of the approximation on the grid of grids. The usual approximations by piecewise constant and piecewise linear basis functions are a special case of tensor product type. The requirement of nested transfer operators is useful to define restrictions between different grids. Sparse grids yield a way for obtaining approximations with a high degree of accuracy. General error estimates are derived for the simplest cases.
    0 references
    sparse grids
    0 references
    approximation of functions
    0 references
    partially ordered sets of regular grids
    0 references
    grid transfer operators
    0 references
    hierarchical decomposition
    0 references
    grid of grids
    0 references
    error estimates
    0 references

    Identifiers