Struct mathru::analysis::ode::Heun

pub struct Heun<T> { /* fields omitted */ }

Solves an ordinary differential equation using Heun's method.

https://en.wikipedia.org/wiki/Heun's_method

Methods

impl<T> Heun<T>

pub fn new(step_size: T) -> Heun<T>

Creates a Heun instance with step size 'step_size'

Argument

• 'step_size'

Panics

'step_size' <= 0.0

Trait Implementations

impl<T> Solver<T> for Heun<T> where
    T: Real, 

fn solve<F>(
    &self,
    func: F,
    init: Vector<T>,
    t_start: T,
    t_end: T
) -> (Vector<T>, Matrix<T>) where
    F: Fn(&T, &Vector<T>) -> Vector<T>, 

Solves func using Heun's method.

Arguments

• 'func' is an explict oridnary diffential equation
• 'init' is the initial value at the time 't_start'
• 't_start' initial time
• 't_end'

Return

The solver returns a vector and a matrix, containing the times used in each step of the algorithm and the respectful values for that time.

Example

use mathru::*;
use mathru::algebra::linear::{Vector, Matrix};
use mathru::analysis::ode::{Solver, Heun};

let f = |t: &f64, _x: &Vector<f64> | -> Vector<f64> { return Vector::new_row(1, vec![1.0]) * (t * &2.0f64); };

let init: Vector<f64> = vector![1.0];
let solver: Heun<f64> = Heun::new(0.01);

let (t, y): (Vector<f64>, Matrix<f64>) = solver.solve(f, init, 0.0, 2.0);