A proof of convergence for the combination technique for the Laplace equation using tools of symbolic computation.

DOI10.1016/S0378-4754(96)00036-5zbMath1037.65508OpenAlexW2038772236MaRDI QIDQ1565845

D. Röschke, Christoph Zenger, Michael Griebel, Hans-Joachim Bungartz

Publication date: 27 May 2003

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-4754(96)00036-5

zbMATH Keywords

symbolic computationsparse gridscomputer algebraMAPLEelliptic PDEsdiscretization errorcombination techniquePDE (partial differential equation)

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Symbolic computation and algebraic computation (68W30) Error bounds for boundary value problems involving PDEs (65N15)

Related Items

Multi-index Monte Carlo: when sparsity meets sampling ⋮ PDE formulation of some SABR/LIBOR market models and its numerical solution with a sparse grid combination technique ⋮ AMFR-W Numerical Methods for Solving High-Dimensional SABR/LIBOR PDE Models ⋮ An Adaptive Multiscale Approach for Electronic Structure Methods

Uses Software

• Maple

Cites Work

• Asymptotic expansions of the discretization error of boundary value problems of the Laplace equation in rectangular domains
• On the Degree of Convergence of Solutions of Difference Equations to the Solution of the Dirichlet Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item