pub struct BKFactorized<S>where
S: Data,{
pub a: ArrayBase<S, Dim<[usize; 2]>>,
pub ipiv: Vec<i32>,
}Expand description
Represents the Bunch–Kaufman factorization of a Hermitian (or real
symmetric) matrix as A = P * U * D * U^H * P^T.
Fields§
§a: ArrayBase<S, Dim<[usize; 2]>>§ipiv: Vec<i32>Implementations§
Source§impl<A, S> BKFactorized<S>
impl<A, S> BKFactorized<S>
Sourcepub fn deth(&self) -> <A as Scalar>::Real
pub fn deth(&self) -> <A as Scalar>::Real
Computes the determinant of the factorized Hermitian (or real symmetric) matrix.
Sourcepub fn sln_deth(&self) -> (<A as Scalar>::Real, <A as Scalar>::Real)
pub fn sln_deth(&self) -> (<A as Scalar>::Real, <A as Scalar>::Real)
Computes the (sign, natural_log) of the determinant of the factorized
Hermitian (or real symmetric) matrix.
The natural_log is the natural logarithm of the absolute value of the
determinant. If the determinant is zero, sign is 0 and natural_log
is negative infinity.
To obtain the determinant, you can compute sign * natural_log.exp()
or just call .deth() instead.
This method is more robust than .deth() to very small or very large
determinants since it returns the natural logarithm of the determinant
rather than the determinant itself.
Sourcepub fn deth_into(self) -> <A as Scalar>::Real
pub fn deth_into(self) -> <A as Scalar>::Real
Computes the determinant of the factorized Hermitian (or real symmetric) matrix.
Sourcepub fn sln_deth_into(self) -> (<A as Scalar>::Real, <A as Scalar>::Real)
pub fn sln_deth_into(self) -> (<A as Scalar>::Real, <A as Scalar>::Real)
Computes the (sign, natural_log) of the determinant of the factorized
Hermitian (or real symmetric) matrix.
The natural_log is the natural logarithm of the absolute value of the
determinant. If the determinant is zero, sign is 0 and natural_log
is negative infinity.
To obtain the determinant, you can compute sign * natural_log.exp()
or just call .deth_into() instead.
This method is more robust than .deth_into() to very small or very
large determinants since it returns the natural logarithm of the
determinant rather than the determinant itself.
Trait Implementations§
Source§impl<A, S> InverseH for BKFactorized<S>
impl<A, S> InverseH for BKFactorized<S>
Source§impl<A, S> InverseHInto for BKFactorized<S>
impl<A, S> InverseHInto for BKFactorized<S>
Source§impl<A, S> SolveH<A> for BKFactorized<S>
impl<A, S> SolveH<A> for BKFactorized<S>
Source§fn solveh_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Dim<[usize; 1]>>,
) -> Result<&'a mut ArrayBase<Sb, Dim<[usize; 1]>>, LinalgError>where
Sb: DataMut<Elem = A>,
fn solveh_inplace<'a, Sb>(
&self,
rhs: &'a mut ArrayBase<Sb, Dim<[usize; 1]>>,
) -> Result<&'a mut ArrayBase<Sb, Dim<[usize; 1]>>, LinalgError>where
Sb: DataMut<Elem = A>,
A * x = b with Hermitian (or real
symmetric) matrix A, where A is self, b is the argument, and
x is the successful result. The value of x is also assigned to the
argument. Read moreSource§fn solveh<S>(
&self,
b: &ArrayBase<S, Dim<[usize; 1]>>,
) -> Result<ArrayBase<OwnedRepr<A>, Dim<[usize; 1]>>, LinalgError>where
S: Data<Elem = A>,
fn solveh<S>(
&self,
b: &ArrayBase<S, Dim<[usize; 1]>>,
) -> Result<ArrayBase<OwnedRepr<A>, Dim<[usize; 1]>>, LinalgError>where
S: Data<Elem = A>,
A * x = b with Hermitian (or real
symmetric) matrix A, where A is self, b is the argument, and
x is the successful result. Read moreSource§fn solveh_into<S>(
&self,
b: ArrayBase<S, Dim<[usize; 1]>>,
) -> Result<ArrayBase<S, Dim<[usize; 1]>>, LinalgError>where
S: DataMut<Elem = A>,
fn solveh_into<S>(
&self,
b: ArrayBase<S, Dim<[usize; 1]>>,
) -> Result<ArrayBase<S, Dim<[usize; 1]>>, LinalgError>where
S: DataMut<Elem = A>,
A * x = b with Hermitian (or real
symmetric) matrix A, where A is self, b is the argument, and
x is the successful result. Read moreAuto Trait Implementations§
impl<S> Freeze for BKFactorized<S>where
S: Freeze,
impl<S> RefUnwindSafe for BKFactorized<S>
impl<S> Send for BKFactorized<S>where
S: Send,
impl<S> Sync for BKFactorized<S>where
S: Sync,
impl<S> Unpin for BKFactorized<S>where
S: Unpin,
impl<S> UnwindSafe for BKFactorized<S>
Blanket Implementations§
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
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>
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>
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>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.