A proof of convergence for the combination technique for the Laplace equation using tools of symbolic computation. (Q1565845): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0378-4754(96)00036-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038772236 / rank | |||
Normal rank | |||
Latest revision as of 11:28, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A proof of convergence for the combination technique for the Laplace equation using tools of symbolic computation. |
scientific article |
Statements
A proof of convergence for the combination technique for the Laplace equation using tools of symbolic computation. (English)
0 references
27 May 2003
0 references
computer algebra
0 references
PDE (partial differential equation)
0 references
elliptic PDEs
0 references
combination technique
0 references
sparse grids
0 references
MAPLE
0 references
symbolic computation
0 references
discretization error
0 references
0 references
