A new aggregation algorithm based on coordinates partitioning recursively for algebraic multigrid method (Q1789703)
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 new aggregation algorithm based on coordinates partitioning recursively for algebraic multigrid method |
scientific article; zbMATH DE number 6950478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new aggregation algorithm based on coordinates partitioning recursively for algebraic multigrid method |
scientific article; zbMATH DE number 6950478 |
Statements
A new aggregation algorithm based on coordinates partitioning recursively for algebraic multigrid method (English)
0 references
10 October 2018
0 references
sparse linear algebraic equations
0 references
aggregation based algebraic multigrid
0 references
preconditioner
0 references
Krylov subspace method
0 references
graph partitioning
0 references
0 references
0 references
0 references
0.8504270911216736
0 references
0.8384653329849243
0 references
0.7849236726760864
0 references
0.7747567892074585
0 references
