A proof of convergence for the combination technique for the Laplace equation using tools of symbolic computation. (Q1565845): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4002421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3140818 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotic expansions of the discretization error of boundary value problems of the Laplace equation in rectangular domains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Degree of Convergence of Solutions of Difference Equations to the Solution of the Dirichlet Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4010713 / rank | |||
Normal rank |
Revision as of 17:12, 5 June 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