Skip to main content

DaeProblem

Struct DaeProblem 

Source
pub struct DaeProblem<S: Scalar, F, M>
where F: Fn(S, &[S], &mut [S]), M: Fn(&mut [S]),
{ pub f: F, pub mass: M, pub t0: S, pub tf: S, pub y0: Vec<S>, pub alg_indices: Vec<usize>, }
Expand description

DAE (Differential-Algebraic Equation) problem.

Represents: M * y’ = f(t, y)

where M is a (possibly singular) mass matrix.

  • When M is nonsingular, this is equivalent to y’ = M⁻¹ f(t, y)
  • When M is singular (index-1 DAE), some equations are algebraic constraints

§Example: Pendulum DAE

The pendulum in Cartesian coordinates:

x'' = -λx         (x-component of constraint force)
y'' = -λy - g     (y-component + gravity)
x² + y² = L²      (constraint: pendulum length)

Written as first-order DAE with y = [x, y, vx, vy, λ]:

x'  = vx           (differential)
y'  = vy           (differential)
vx' = -λx          (differential)
vy' = -λy - g      (differential)
0   = x² + y² - L² (algebraic)

Fields§

§f: F

Right-hand side function

§mass: M

Mass matrix function

§t0: S

Initial time

§tf: S

Final time

§y0: Vec<S>

Initial state (must be consistent!)

§alg_indices: Vec<usize>

Indices of algebraic variables (where M[i,i] = 0)

Implementations§

Source§

impl<S: Scalar, F, M> DaeProblem<S, F, M>
where F: Fn(S, &[S], &mut [S]), M: Fn(&mut [S]),

Source

pub fn new( f: F, mass: M, t0: S, tf: S, y0: Vec<S>, alg_indices: Vec<usize>, ) -> Self

Create a new DAE problem.

§Arguments
  • f - RHS function
  • mass - Mass matrix function (fills row-major array)
  • t0 - Initial time
  • tf - Final time
  • y0 - Initial state (must satisfy algebraic constraints!)
  • alg_indices - Indices of algebraic equations
Source

pub fn dim(&self) -> usize

Dimension of the system.

Trait Implementations§

Source§

impl<S: Scalar, F, M> OdeSystem<S> for DaeProblem<S, F, M>
where F: Fn(S, &[S], &mut [S]), M: Fn(&mut [S]),

Source§

fn dim(&self) -> usize

Dimension of the system.
Source§

fn rhs(&self, t: S, y: &[S], dydt: &mut [S])

Compute the right-hand side: dydt = f(t, y)
Source§

fn has_mass_matrix(&self) -> bool

Does this system have a mass matrix?
Source§

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

Is the mass matrix singular? (i.e., is this a DAE?)
Source§

fn algebraic_indices(&self) -> Vec<usize>

Return indices of algebraic variables (where M[i,i] = 0). Read more
Source§

fn jacobian(&self, t: S, y: &[S], jac: &mut [S])

Optionally compute the Jacobian: J = ∂f/∂y, row-major (jac[i*n + j] = ∂f_i/∂y_j, length ). Read more
Source§

fn is_autonomous(&self) -> bool

Is the system autonomous? (f does not depend on t explicitly)

Auto Trait Implementations§

§

impl<S, F, M> Freeze for DaeProblem<S, F, M>
where F: Freeze, M: Freeze, S: Freeze,

§

impl<S, F, M> RefUnwindSafe for DaeProblem<S, F, M>

§

impl<S, F, M> Send for DaeProblem<S, F, M>
where F: Send, M: Send,

§

impl<S, F, M> Sync for DaeProblem<S, F, M>
where F: Sync, M: Sync,

§

impl<S, F, M> Unpin for DaeProblem<S, F, M>
where F: Unpin, M: Unpin, S: Unpin,

§

impl<S, F, M> UnsafeUnpin for DaeProblem<S, F, M>

§

impl<S, F, M> UnwindSafe for DaeProblem<S, F, M>
where F: UnwindSafe, M: UnwindSafe, S: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V