A proof of convergence for the combination technique for the Laplace equation using tools of symbolic computation.
From MaRDI portal
(Redirected from Publication:1565845)
Recommendations
- Convergence of the Combination Technique for Second-Order Elliptic Differential Equations
- scientific article; zbMATH DE number 440658
- Proving the convergence of the iterative methods by using symbolic computation in Maple
- Error analysis of the combination technique
- The combination technique and some generalisations
Cites work
- Asymptotic expansions of the discretization error of boundary value problems of the Laplace equation in rectangular domains
- scientific article; zbMATH DE number 440658 (Why is no real title available?)
- scientific article; zbMATH DE number 52062 (Why is no real title available?)
- scientific article; zbMATH DE number 66109 (Why is no real title available?)
- On the Degree of Convergence of Solutions of Difference Equations to the Solution of the Dirichlet Problem
Cited in
(6)- PDE formulation of some SABR/LIBOR market models and its numerical solution with a sparse grid combination technique
- Multi-index Monte Carlo: when sparsity meets sampling
- scientific article; zbMATH DE number 653220 (Why is no real title available?)
- An Adaptive Multiscale Approach for Electronic Structure Methods
- Proving the convergence of the iterative methods by using symbolic computation in Maple
- AMFR-W numerical methods for solving high-dimensional SABR/LIBOR PDE models
This page was built for publication: A proof of convergence for the combination technique for the Laplace equation using tools of symbolic computation.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1565845)