pub(crate) struct Lu {
factors: DMatrix<Complex>,
permutation: Perm<usize>,
equilibration: Option<Equilibration>,
}Expand description
Packed pivoted LU: overwrite the operator and share its triangular storage.
Fields§
§factors: DMatrix<Complex>§permutation: Perm<usize>§equilibration: Option<Equilibration>Implementations§
Source§impl Lu
impl Lu
Sourcepub(crate) fn state_size(n: usize) -> Result<usize>
pub(crate) fn state_size(n: usize) -> Result<usize>
Bytes for factors, forward permutation, and canonical row/column scales.
Sourcepub(crate) fn write_state(&self, writer: &mut Writer)
pub(crate) fn write_state(&self, writer: &mut Writer)
Write numerical factors without refactorizing their operator.
Sourcepub(crate) fn read_state(reader: &mut Reader<'_>, n: usize) -> Result<Self>
pub(crate) fn read_state(reader: &mut Reader<'_>, n: usize) -> Result<Self>
Restore numerical factors; the containing record provides the dimension.
Source§impl Lu
impl Lu
pub(crate) fn new(factors: DMatrix<Complex>) -> Result<Self>
Sourcepub(crate) fn solve_in_place(&self, rhs: MatMut<'_, Complex>) -> Result<()>
pub(crate) fn solve_in_place(&self, rhs: MatMut<'_, Complex>) -> Result<()>
Solve A X = B in place, with A the operator given to Lu::new.
Sourcepub(crate) fn solve_adjoint_in_place(
&self,
rhs: MatMut<'_, Complex>,
) -> Result<()>
pub(crate) fn solve_adjoint_in_place( &self, rhs: MatMut<'_, Complex>, ) -> Result<()>
Solve Aᴴ X = B in place.
fn solve_with(&self, rhs: MatMut<'_, Complex>, adjoint: bool) -> Result<()>
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Lu
impl RefUnwindSafe for Lu
impl Send for Lu
impl Sync for Lu
impl Unpin for Lu
impl UnwindSafe for Lu
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
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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 more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.