Struct peroxide::numerical::spline::CubicSpline

pub struct CubicSpline { /* fields omitted */ }

Cubic Spline (Natural)

Implementations

impl CubicSpline

pub fn from_nodes(node_x: Vec<f64>, node_y: Vec<f64>) -> Self

Examples

#[macro_use]
extern crate peroxide;
use peroxide::fuga::*;

fn main() {
    let x = c!(0.9, 1.3, 1.9, 2.1);
    let y = c!(1.3, 1.5, 1.85, 2.1);

    let s = CubicSpline::from_nodes(x, y);

    for i in 0 .. 4 {
        println!("{}", s.eval(i as f64 / 2.0));
    }
}

pub fn eval<T>(&self, x: T) -> f64 where
    T: Into<f64> + Copy, 

Evaluate cubic spline with value

Examples

#[macro_use]
extern crate peroxide;
use peroxide::fuga::*;

fn main() {
    let x = c!(0.9, 1.3, 1.9, 2.1);
    let y = c!(1.3, 1.5, 1.85, 2.1);

    let s = CubicSpline::from_nodes(x, y);

    s.eval(2.0);
}

pub fn polynomial<T>(&self, x: T) -> &Polynomial where
    T: Into<f64> + Copy, 

Returns a reference the Polynomial at the given point x.

Examples

#[macro_use]
extern crate peroxide;
use peroxide::fuga::*;

fn main() {
    let x = c!(0.9, 1.3, 1.9, 2.1);
    let y = c!(1.3, 1.5, 1.85, 2.1);

    let s = CubicSpline::from_nodes(x, y);

    let p = s.polynomial(2.0);
    let v = p.eval(1.9);

    assert_eq!((v * 100.0).round() / 100.0, 1.85)
}

If x is outside of the range of polynomials, the first or last polynomial will be returned, depending if x is lower of the first interpolation point or higher of the last interpolation point.

pub fn extend_with_nodes(&mut self, node_x: Vec<f64>, node_y: Vec<f64>)

Extends the spline with the given nodes.

The method ensures that the transition between each polynomial is smooth and that the spline interpolation of the new nodes is calculated around x = 0 in order to avoid that successive spline extensions with large x values become inaccurate.

pub fn number_of_polynomials(&self) -> usize

Returns the number of polynimials that describe the CubicSpline

Examples

#[macro_use]
extern crate peroxide;
use peroxide::fuga::*;

fn main() {
    let x = c!(0.9, 1.3, 1.9, 2.1);
    let y = c!(1.3, 1.5, 1.85, 2.1);

    let s = CubicSpline::from_nodes(x, y);

    assert_eq!(s.number_of_polynomials(), 3);
}

Trait Implementations

impl Calculus for CubicSpline

pub fn diff(&self) -> Self

pub fn integral(&self) -> Self

impl Clone for CubicSpline

pub fn clone(&self) -> CubicSpline

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for CubicSpline

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for CubicSpline

pub fn default() -> CubicSpline

Returns the "default value" for a type.

impl Environment for CubicSpline

impl From<Vec<(Range<f64>, Polynomial), Global>> for CubicSpline

pub fn from(polynomials: Vec<(Range<f64>, Polynomial)>) -> Self

Performs the conversion.

impl Index<usize> for CubicSpline

type Output = (Range<f64>, Polynomial)

The returned type after indexing.

pub fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl Into<Vec<(Range<f64>, Polynomial), Global>> for CubicSpline

pub fn into(self) -> Vec<(Range<f64>, Polynomial)>

Performs the conversion.

impl Into<Vec<Polynomial, Global>> for CubicSpline

pub fn into(self) -> Vec<Polynomial>

Performs the conversion.