ida 0.1.1

A pure Rust port of the Implicit Differential-Algebraic solver from the Sundials suite.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63

use super::*;

use ndarray::array;
use nearly_eq::*;
use tol_control::*;

#[cfg(feature = "data_trace")]
use serde::Serialize;

mod complete_step;
mod get_solution;
mod nonlinear_solve;
mod predict;
mod restore;
mod set_coeffs;
mod test_error;

#[derive(Clone, Copy, Debug)]
#[cfg_attr(feature = "data_trace", derive(Serialize))]
struct Dummy {}

impl ModelSpec for Dummy {
    type Scalar = f64;
    type Dim = Ix1;
    fn model_size(&self) -> usize {
        3
    }
}

impl Residual for Dummy {
    fn res<S1, S2, S3>(
        &self,
        _tres: Self::Scalar,
        _yy: ArrayBase<S1, Ix1>,
        _yp: ArrayBase<S2, Ix1>,
        mut _resval: ArrayBase<S3, Ix1>,
    ) where
        S1: ndarray::Data<Elem = Self::Scalar>,
        S2: ndarray::Data<Elem = Self::Scalar>,
        S3: ndarray::DataMut<Elem = Self::Scalar>,
    {
    }
}

impl Jacobian for Dummy {
    fn jac<S1, S2, S3, S4>(
        &self,
        _tt: Self::Scalar,
        _cj: Self::Scalar,
        _yy: ArrayBase<S1, Ix1>,
        _yp: ArrayBase<S2, Ix1>,
        _rr: ArrayBase<S3, Ix1>,
        mut _j: ArrayBase<S4, Ix2>,
    ) where
        S1: ndarray::Data<Elem = Self::Scalar>,
        S2: ndarray::Data<Elem = Self::Scalar>,
        S3: ndarray::Data<Elem = Self::Scalar>,
        S4: ndarray::DataMut<Elem = Self::Scalar>,
    {
    }
}

impl Root for Dummy {}