TWeakAlgAdmCond Class Reference

Weak admissibility condition based on matrix graph criteria.

#include <TAlgAdmCond.hh>

Inheritance diagram for TWeakAlgAdmCond:

Public Member Functions
	TWeakAlgAdmCond (any_const_sparse_matrix_t S, const TPermutation *perm_i2e=nullptr, const uint distance=1, const uint connectivity=0)
	TWeakAlgAdmCond (any_const_sparse_matrix_t S, const TPermutation *row_perm_i2e, const TPermutation *col_perm_i2e, const uint distance=1, const uint connectivity=0)
virtual	~TWeakAlgAdmCond ()
	dtor
virtual bool	is_adm (const TBlockCluster *c) const
	return true if cl is weakly admissible
Public Member Functions inherited from TAlgAdmCond
	TAlgAdmCond (any_const_sparse_matrix_t S, const TPermutation *perm_i2e=nullptr)
	TAlgAdmCond (any_const_sparse_matrix_t S, const TPermutation *row_perm_i2e, const TPermutation *col_perm_i2e)
virtual	~TAlgAdmCond ()
	dtor
Public Member Functions inherited from TAdmCondition
	TAdmCondition ()
	ctor
virtual	~TAdmCondition ()
	dtor

Constructor & Destructor Documentation

TWeakAlgAdmCond() [1/2]

TWeakAlgAdmCond	(	any_const_sparse_matrix_t	S,
		const TPermutation *	perm_i2e = nullptr,
		const uint	distance = 1,
		const uint	connectivity = 0
	)

construct object for algebraic weak admissibility based on connectivity in S

• distance is the upper limit for the path length between clusters
• connectivity is the upper limit for direct edges between clusters

TWeakAlgAdmCond() [2/2]

TWeakAlgAdmCond	(	any_const_sparse_matrix_t	S,
		const TPermutation *	row_perm_i2e,
		const TPermutation *	col_perm_i2e,
		const uint	distance = 1,
		const uint	connectivity = 0
	)

construct object for algebraic weak admissibility with row and column permutations row_perm_i2e and col_perm_i2e (from internal to external ordering)