A proof of the consistency of the finite difference technique on sparse grids
combination techniqueconsistencydifferential operatorsextrapolationfinite-difference methodGalerkin methodmultiresolution analysissparse gridwavelet
Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Extrapolation to the limit, deferred corrections (65B05) Finite difference methods for boundary value problems involving PDEs (65N06) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Numerical methods for wavelets (65T60)
The author shows the equivalence of the finite discretization of differential operators on sparse grids and the extrapolation formula of the combination technique applied to discretized differential operators on rectangular subgrids which correspond to the subspace \(V^I\) for \(I\subset\Lambda\), where \(\Lambda\) is some index set. This subspace consists of the (anisotropic) tensor product of the space \(V^l= \text{span}\{\varphi(2^l x-s)\mid s\in \mathbb Z\}\), where the scaling function \(\phi\) induces a multiresolution analysis. The combination technique extrapolates a very accurate solution on the orthogonal sum of orthogonal complements of \(V^I\), from finite difference or Galerkin solutions on \(V^I\). The above result gives a new proof of the consistency of the sparse grid finite difference technique, thus improving previous results in the following points: weaker smoothness is required, the proof allows for quite general index set \(\Lambda\) and covers higher order discretization and compact finite difference schemes.
- scientific article; zbMATH DE number 440658
- Analysis of linear difference schemes in the sparse grid combination technique
- Sparse grids
- Convergence of the Combination Technique for Second-Order Elliptic Differential Equations
- Multilevel algorithms for finite difference discretizations on sparse grids
- PDE formulation of some SABR/LIBOR market models and its numerical solution with a sparse grid combination technique
- The exponent of discrepancy of sparse grids is at least 2. 1933
- Convergence results for 3D sparse grid approaches
- WAMR: an adaptive wavelet method for the simulation of compressible reacting flow. Part I: Accuracy and efficiency of algorithm
- Convergence to a model in sparse-Lagrangian FDF simulations
This page was built for publication: A proof of the consistency of the finite difference technique on sparse grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1840762)
