pub struct SolveResidual {
lu: Lu,
value: DMatrix<Complex>,
}Expand description
What solve saves for its derivatives: the LU factors and the solution. Both
derivative directions solve with the same factors.
Fields§
§lu: Lu§value: DMatrix<Complex>Implementations§
Source§impl SolveResidual
impl SolveResidual
Source§impl SolveResidual
impl SolveResidual
Sourcepub const fn value(&self) -> &DMatrix<Complex>
pub const fn value(&self) -> &DMatrix<Complex>
The solution X of A X = B, one column per right-hand side, which the pullback
reads.
Sourcepub fn shape(&self) -> (usize, usize)
pub fn shape(&self) -> (usize, usize)
The shape of the solution: unknowns and right-hand sides.
Sourcepub fn pushforward(
&self,
operator: &DMatrix<Complex>,
rhs: DMatrix<Complex>,
) -> Result<DMatrix<Complex>>
pub fn pushforward( &self, operator: &DMatrix<Complex>, rhs: DMatrix<Complex>, ) -> Result<DMatrix<Complex>>
Solve A dX = dB - dA X, reusing the forward LU and the tangent RHS buffer.
pub(crate) fn adjoint_rhs( &self, cotangent: DMatrix<Complex>, ) -> Result<DMatrix<Complex>>
Trait Implementations§
Source§impl Clone for SolveResidual
impl Clone for SolveResidual
Source§fn clone(&self) -> SolveResidual
fn clone(&self) -> SolveResidual
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for SolveResidual
impl Debug for SolveResidual
Source§impl SavedState for SolveResidual
impl SavedState for SolveResidual
Auto Trait Implementations§
impl Freeze for SolveResidual
impl RefUnwindSafe for SolveResidual
impl Send for SolveResidual
impl Sync for SolveResidual
impl Unpin for SolveResidual
impl UnwindSafe for SolveResidual
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.