Struct BarycentricLagrange 

pub struct BarycentricLagrange<S: Scalar> { /* private fields */ }

Barycentric Lagrange interpolant.

Evaluates the unique polynomial of degree n-1 passing through n data points using the numerically stable barycentric formula. O(n) per evaluation after O(n^2) setup.

Implementations

impl<S: Scalar> BarycentricLagrange<S>

pub fn new(x: &[S], y: &[S]) -> Result<Self, InterpError>

Create a barycentric Lagrange interpolant from data points.

Errors

Returns error if fewer than 1 point or data is not sorted.

pub fn chebyshev<F: Fn(S) -> S>(f: F, a: S, b: S, n: usize) -> Self

Create from Chebyshev nodes on [a, b].

Uses n Chebyshev nodes of the first kind, which minimize the maximum interpolation error (near-optimal for polynomial interpolation). Uses the known closed-form barycentric weights for numerical stability.

Trait Implementations

impl<S: Scalar> Interpolant<S> for BarycentricLagrange<S>

fn interpolate(&self, x: S) -> S

Evaluate the interpolant at x. Extrapolates using the first/last segment if x is outside the data range.

fn interpolate_vec(&self, xs: &[S]) -> Vec<S>

Evaluate at multiple points.

fn derivative(&self, x: S) -> Option<S>

First derivative at x, if available.

fn integrate(&self, a: S, b: S) -> Option<S>

Definite integral from a to b, if available.