A domain partitioning algorithm without subdomain overlap for solving parabolic equations (Q1311554)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A domain partitioning algorithm without subdomain overlap for solving parabolic equations |
scientific article; zbMATH DE number 486838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A domain partitioning algorithm without subdomain overlap for solving parabolic equations |
scientific article; zbMATH DE number 486838 |
Statements
A domain partitioning algorithm without subdomain overlap for solving parabolic equations (English)
0 references
3 March 1994
0 references
A non-iterative domain partitioning algorithm in which subdomains do not overlap is considered for solving multi-dimensional parabolic problems. The algorithm is similar in structure to the method of alternating directions. Error estimates are obtained for the approximate solution in the case of the Dirichlet and Neumann problems.
0 references
error estimates
0 references
Dirichlet problems
0 references
non-iterative domain partitioning algorithm
0 references
parabolic problems
0 references
method of alternating directions
0 references
Neumann problems
0 references
0.8301032781600952
0 references
0.8292415142059326
0 references
