Multilevel algorithms for finite difference discretizations on sparse grids

From MaRDI portal





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.











This page was built for publication: Multilevel algorithms for finite difference discretizations on sparse grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5934370)