Reducing Complexity in Parallel Algebraic Multigrid Preconditioners (Q5470508)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5029280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing Complexity in Parallel Algebraic Multigrid Preconditioners |
scientific article; zbMATH DE number 5029280 |
Statements
Reducing Complexity in Parallel Algebraic Multigrid Preconditioners (English)
0 references
31 May 2006
0 references
parallel coarsening algorithms
0 references
Poisson equation
0 references
finite difference method
0 references
numerical examples
0 references
large unstructured sparse linear systems
0 references
computational complexity
0 references
Krylov subspace methods
0 references
0.8648805618286133
0 references
0.8348121643066406
0 references
0.8348116874694824
0 references
0.8337409496307373
0 references
