The bit-complexity of discrete solutions of partial differential equations: Compact multigrid (Q922664)
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: The bit-complexity of discrete solutions of partial differential equations: Compact multigrid |
scientific article; zbMATH DE number 4170031
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bit-complexity of discrete solutions of partial differential equations: Compact multigrid |
scientific article; zbMATH DE number 4170031 |
Statements
The bit-complexity of discrete solutions of partial differential equations: Compact multigrid (English)
0 references
1990
0 references
The authors consider the complexity of multigrid algorithms for solving systems of linear algebraic equations arising in the numerical solution of partial differential equations.
0 references
compact multigrid
0 references
complexity
0 references
multigrid algorithms
0 references
0 references
