gko::experimental::reorder Namespace Reference

The Reorder namespace. More...

Classes
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...

Typedefs
using	rcm_starting_strategy = gko::reorder::starting_strategy

Enumerations
enum	mc64_strategy { max_diagonal_product, max_diagonal_sum }
	Strategy defining the goal of the MC64 reordering. More...

Detailed Description

The Reorder namespace.

Enumeration Type Documentation

mc64_strategy

enum gko::experimental::reorder::mc64_strategy

strong

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.