pub struct ReducedDaeSystem<S: Scalar> { /* private fields */ }Implementations§
Source§impl<S: Scalar> ReducedDaeSystem<S>
impl<S: Scalar> ReducedDaeSystem<S>
Sourcepub fn info(&self) -> &DaeIndexInfo
pub fn info(&self) -> &DaeIndexInfo
Get the differentiation info.
Sourcepub fn augmented_dim(&self) -> usize
pub fn augmented_dim(&self) -> usize
Get the augmented system dimension.
Sourcepub fn original_dim(&self) -> usize
pub fn original_dim(&self) -> usize
Get the original system dimension.
Sourcepub fn extract_original(&self, y_aug: &[S]) -> Vec<S>
pub fn extract_original(&self, y_aug: &[S]) -> Vec<S>
Extract the original state variables from an augmented state vector.
Sourcepub fn augment_initial_conditions(&self, t0: S, y0: &[S]) -> Vec<S>
pub fn augment_initial_conditions(&self, t0: S, y0: &[S]) -> Vec<S>
Build augmented initial conditions.
The new variables (time derivatives of algebraic variables) are initialized by evaluating the constraints’ time derivatives at the initial point.
Trait Implementations§
Source§impl<S: Scalar> Debug for ReducedDaeSystem<S>
A reduced (index-1) DAE system produced by differentiating constraints.
impl<S: Scalar> Debug for ReducedDaeSystem<S>
A reduced (index-1) DAE system produced by differentiating constraints.
The reduced system augments the original with:
- New variables for the time derivatives of algebraic variables
- Differentiated constraint equations
It implements OdeSystem<S> so it can be used directly with BDF/Radau solvers.
Source§impl<S: Scalar> OdeSystem<S> for ReducedDaeSystem<S>
impl<S: Scalar> OdeSystem<S> for ReducedDaeSystem<S>
Source§fn has_mass_matrix(&self) -> bool
fn has_mass_matrix(&self) -> bool
Does this system have a mass matrix?
Source§fn mass_matrix(&self, mass: &mut [S])
fn mass_matrix(&self, mass: &mut [S])
Get the mass matrix M for the DAE: M * y’ = f(t, y) Read more
Source§fn is_singular_mass(&self) -> bool
fn is_singular_mass(&self) -> bool
Is the mass matrix singular? (i.e., is this a DAE?)
Source§fn algebraic_indices(&self) -> Vec<usize>
fn algebraic_indices(&self) -> Vec<usize>
Return indices of algebraic variables (where
M[i,i] = 0). Read moreSource§fn jacobian(&self, t: S, y: &[S], jac: &mut [S])
fn jacobian(&self, t: S, y: &[S], jac: &mut [S])
Optionally compute the Jacobian: J = ∂f/∂y
Default implementation uses finite differences.
Source§fn is_autonomous(&self) -> bool
fn is_autonomous(&self) -> bool
Is the system autonomous? (f does not depend on t explicitly)
Auto Trait Implementations§
impl<S> Freeze for ReducedDaeSystem<S>where
S: Freeze,
impl<S> !RefUnwindSafe for ReducedDaeSystem<S>
impl<S> Send for ReducedDaeSystem<S>
impl<S> Sync for ReducedDaeSystem<S>
impl<S> Unpin for ReducedDaeSystem<S>where
S: Unpin,
impl<S> UnsafeUnpin for ReducedDaeSystem<S>where
S: UnsafeUnpin,
impl<S> !UnwindSafe for ReducedDaeSystem<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
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