The Reorder namespace.
More...
|
| class | Amd |
| | Computes a Approximate Minimum Degree (AMD) reordering of an input matrix. More...
|
| |
| class | Mc64 |
| | MC64 is an algorithm for permuting large entries to the diagonal of a sparse matrix. More...
|
| |
| class | Rcm |
| | Rcm (Reverse Cuthill-McKee) is a reordering algorithm minimizing the bandwidth of a matrix. More...
|
| |
| class | ScaledReordered |
| | Provides an interface to wrap reorderings like Rcm and diagonal scaling like equilibration around a LinOp like e.g. More...
|
| |
|
|
using | rcm_starting_strategy = gko::reorder::starting_strategy |
| |
|
| enum class | mc64_strategy { max_diagonal_product
, max_diagonal_sum
} |
| | Strategy defining the goal of the MC64 reordering. More...
|
| |
◆ mc64_strategy
Strategy defining the goal of the MC64 reordering.
max_diagonal_product aims at maximizing the product of absolute diagonal entries. max_diag_sum aims at maximizing the sum of absolute values for the diagonal entries.