Verification of the UpDown Scheme (Q7361527)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

AFP entry UpDown_Scheme
Language Label Description Also known as
default for all languages
No label defined
    English
    Verification of the UpDown Scheme
    AFP entry UpDown_Scheme

      Statements

      28 January 2015
      0 references
      Johannes Hölzl
      0 references
      Verification of the UpDown Scheme (English)
      0 references
      The UpDown scheme is a recursive scheme used to compute the stiffness matrix on a special form of sparse grids. Usually, when discretizing a Euclidean space of dimension d we need O(n^d) points, for n points along each dimension. Sparse grids are a hierarchical representation where the number of points is reduced to O(n * log(n)^d). One disadvantage of such sparse grids is that the algorithm now operate recursively in the dimensions and levels of the sparse grid. The UpDown scheme allows us to compute the stiffness matrix on such a sparse grid. The stiffness matrix represents the influence of each representation function on the L^2 scalar product. For a detailed description see Dirk Pflüger's PhD thesis. This formalization was developed as an interdisciplinary project (IDP) at the Technische Universität München.
      0 references