pub struct OrderingAlgorithms;Available on crate feature
superlu_dist only.Expand description
Ordering algorithms implementation
Implementations§
Source§impl OrderingAlgorithms
impl OrderingAlgorithms
Sourcepub fn natural_ordering(n: usize) -> Vec<usize>
pub fn natural_ordering(n: usize) -> Vec<usize>
Natural ordering (identity permutation)
Sourcepub fn amd_ordering(matrix: &CsrMatrix<f64>) -> Vec<usize>
pub fn amd_ordering(matrix: &CsrMatrix<f64>) -> Vec<usize>
Approximate Minimum Degree (AMD) ordering
Sourcepub fn mmd_ata_ordering(matrix: &CsrMatrix<f64>) -> Vec<usize>
pub fn mmd_ata_ordering(matrix: &CsrMatrix<f64>) -> Vec<usize>
Minimum Degree on A + A^T structure
Sourcepub fn mmd_ata_ordering_distributed(
matrix: &CsrMatrix<f64>,
comm: &UniverseComm,
distribution: &BlockCyclicDistribution,
) -> Result<Vec<usize>, KError>
pub fn mmd_ata_ordering_distributed( matrix: &CsrMatrix<f64>, comm: &UniverseComm, distribution: &BlockCyclicDistribution, ) -> Result<Vec<usize>, KError>
MMD ordering using A + A^T pattern with distributed assembly This version properly handles distributed matrices by gathering global pattern
Sourcepub fn metis_ordering(matrix: &CsrMatrix<f64>) -> Result<Vec<usize>, KError>
pub fn metis_ordering(matrix: &CsrMatrix<f64>) -> Result<Vec<usize>, KError>
METIS ordering (placeholder - would interface with METIS C library)
Sourcepub fn parmetis_ordering(
matrix: &CsrMatrix<f64>,
comm: &UniverseComm,
distribution: &BlockCyclicDistribution,
) -> Result<Vec<usize>, KError>
pub fn parmetis_ordering( matrix: &CsrMatrix<f64>, comm: &UniverseComm, distribution: &BlockCyclicDistribution, ) -> Result<Vec<usize>, KError>
ParMETIS ordering for distributed graphs
Auto Trait Implementations§
impl Freeze for OrderingAlgorithms
impl RefUnwindSafe for OrderingAlgorithms
impl Send for OrderingAlgorithms
impl Sync for OrderingAlgorithms
impl Unpin for OrderingAlgorithms
impl UnsafeUnpin for OrderingAlgorithms
impl UnwindSafe for OrderingAlgorithms
Blanket Implementations§
Source§impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
Source§fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
Convert the given value into an approximately equivalent representation.
Source§impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
Source§type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
The error type produced by a failed conversion.
Source§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Convert the subject into an approximately equivalent representation.
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
Source§impl<T> ConvUtil for T
impl<T> ConvUtil for T
Source§fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
Approximate the subject to a given type with the default scheme.
Source§fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>
fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>
Approximate the subject to a given type with a specific scheme.
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.