pub(super) struct InternalSolve {
pub(super) value: DMatrix<Complex>,
factor: InternalFactor,
}Expand description
The forward solution of the internal system and what its adjoint solve reuses.
Fields§
§value: DMatrix<Complex>Solution of the internal system for the forward right-hand sides.
factor: InternalFactorImplementations§
Source§impl InternalSolve
impl InternalSolve
Source§impl InternalSolve
impl InternalSolve
pub(super) fn new( lower: MatRef<'_, Complex>, upper: MatRef<'_, Complex>, rhs: DMatrix<Complex>, ) -> Result<Self>
Sourcepub(super) fn direct(
lower: MatRef<'_, Complex>,
upper: MatRef<'_, Complex>,
rhs: DMatrix<Complex>,
) -> Result<Self>
pub(super) fn direct( lower: MatRef<'_, Complex>, upper: MatRef<'_, Complex>, rhs: DMatrix<Complex>, ) -> Result<Self>
The pivoted LU solve, the branch Self::new takes whenever the Krylov
conditions fail.
Sourcefn with_threshold(
lower: MatRef<'_, Complex>,
upper: MatRef<'_, Complex>,
rhs: DMatrix<Complex>,
min_rows: usize,
) -> Result<Self>
fn with_threshold( lower: MatRef<'_, Complex>, upper: MatRef<'_, Complex>, rhs: DMatrix<Complex>, min_rows: usize, ) -> Result<Self>
Self::new with a lower row threshold, which tests use to reach every
dispatch branch with small systems.
Sourcefn lu(operator: DMatrix<Complex>, rhs: DMatrix<Complex>) -> Result<Self>
fn lu(operator: DMatrix<Complex>, rhs: DMatrix<Complex>) -> Result<Self>
Factor the operator and solve for rhs in place.
Sourcepub(super) fn solve_adjoint(
&self,
lower: MatRef<'_, Complex>,
upper: MatRef<'_, Complex>,
rhs: DMatrix<Complex>,
) -> Result<AdjointSolve<'_>>
pub(super) fn solve_adjoint( &self, lower: MatRef<'_, Complex>, upper: MatRef<'_, Complex>, rhs: DMatrix<Complex>, ) -> Result<AdjointSolve<'_>>
Solve the adjoint system for rhs, reusing the forward solve.
lower and upper must be the reflection pair used by that forward solve.
Trait Implementations§
Source§impl Debug for InternalSolve
impl Debug for InternalSolve
Source§impl SavedState for InternalSolve
impl SavedState for InternalSolve
Auto Trait Implementations§
impl Freeze for InternalSolve
impl RefUnwindSafe for InternalSolve
impl Send for InternalSolve
impl Sync for InternalSolve
impl Unpin for InternalSolve
impl UnwindSafe for InternalSolve
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> 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.