Struct ImplicitDaeProblem
pub struct ImplicitDaeProblem<'a> { /* private fields */ }Description
Validated general residual problem with an explicit variable partition.
For InitialConditionPolicy::SolveConsistent, a residual-native adapter
holds differential state coordinates and algebraic derivative coordinates
fixed while solving for algebraic states and differential derivatives.
This is the semi-explicit index-one initialization contract; it is not a
promise that every general residual has index one.
Implementations§
§impl<'a> ImplicitDaeProblem<'a>
impl<'a> ImplicitDaeProblem<'a>
pub fn new(
system: &'a dyn ImplicitTimeSystem,
variable_kinds: Vec<DaeVariableKind>,
initial_condition: InitialConditionPolicy,
initial_state: Vec<f64>,
initial_derivative: Vec<f64>,
) -> Result<ImplicitDaeProblem<'a>, Diagnostic>
pub fn new( system: &'a dyn ImplicitTimeSystem, variable_kinds: Vec<DaeVariableKind>, initial_condition: InitialConditionPolicy, initial_state: Vec<f64>, initial_derivative: Vec<f64>, ) -> Result<ImplicitDaeProblem<'a>, Diagnostic>
Bind residual actions to one variable partition and initial pair/guess.
§Errors
Returns EQ0705 for empty/mismatched/non-finite vectors or a system
with no differential coordinate. Provided means the complete pair is
already consistent; SolveConsistent treats both vectors as guesses.
pub const fn system(&self) -> &dyn ImplicitTimeSystem
pub const fn system(&self) -> &dyn ImplicitTimeSystem
Residual and JVP action provider.
pub fn variable_kinds(&self) -> &[DaeVariableKind]
pub fn variable_kinds(&self) -> &[DaeVariableKind]
Differential/algebraic role in state coordinate order.
pub const fn initial_condition(&self) -> InitialConditionPolicy
pub const fn initial_condition(&self) -> InitialConditionPolicy
Initial-condition treatment requested from the adapter.
pub fn initial_state(&self) -> &[f64]
pub fn initial_state(&self) -> &[f64]
Initial state or consistency-solve guess.
pub fn initial_derivative(&self) -> &[f64]
pub fn initial_derivative(&self) -> &[f64]
Initial derivative or consistency-solve guess.
Trait Implementations§
Auto Trait Implementations§
impl<'a> Freeze for ImplicitDaeProblem<'a>
impl<'a> !RefUnwindSafe for ImplicitDaeProblem<'a>
impl<'a> !Send for ImplicitDaeProblem<'a>
impl<'a> !Sync for ImplicitDaeProblem<'a>
impl<'a> Unpin for ImplicitDaeProblem<'a>
impl<'a> UnsafeUnpin for ImplicitDaeProblem<'a>
impl<'a> !UnwindSafe for ImplicitDaeProblem<'a>
Blanket Implementations§
Source§impl<T> Any for Twhere
T: 'static + ?Sized,
impl<T> Any for Twhere
T: 'static + ?Sized,
§impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
§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>
§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,
§type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Source§impl<T> Borrow<T> for Twhere
T: ?Sized,
impl<T> Borrow<T> for Twhere
T: ?Sized,
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
§impl<T, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
§fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§impl<T> ConvUtil for T
impl<T> ConvUtil for T
§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>,
§fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
§fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
§fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> Twhere
Self: Distribution<T>,
Source§impl<T> From<T> for T
impl<T> From<T> for T
Source§impl<T, U> Into<U> for Twhere
U: From<T>,
impl<T, U> Into<U> for Twhere
U: From<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>where
F: FnOnce(&Self) -> bool,
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where
F: FnOnce(&Self) -> bool,
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
Source§impl<T> Same for T
impl<T> Same 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>
self from the equivalent element of its
superset. Read more§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).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.