Multilevel algorithms for finite difference discretizations on sparse grids (Q5934370)
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:
scientific article; zbMATH DE number 1606683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multilevel algorithms for finite difference discretizations on sparse grids |
scientific article; zbMATH DE number 1606683 |
Statements
Multilevel algorithms for finite difference discretizations on sparse grids (English)
0 references
19 June 2001
0 references
Two types of multilevel algorithms for finite difference discretizations on sparse grids of partial differential equations are discussed. The first one is similar to the multiplicative subspace correction algorithms for the finite element methods, and the second uses approximations from coarser grids to improve the approximation of the solution on the finest grid.
0 references
finite differences
0 references
sparse grids
0 references
multilevel algorithms
0 references
Poisson equation
0 references
subspace correction algorithms
0 references
finite element methods
0 references
0.814746618270874
0 references
0.8040239214897156
0 references
