Struct GaussLegendre

pub struct GaussLegendre { /* private fields */ }

An n-point Gauss-Legendre rule on [-1, 1].

Exact for polynomials of degree up to 2n - 1; it carries no error estimate, so use it only where the integrand’s degree is known (or use integrate). Nodes come from Newton’s method on P_n started at Tricomi’s asymptotic estimates.

Implementations

impl GaussLegendre

pub const MAX_POINTS: usize = 512usize

Most points supported; beyond it the three-term recurrence’s rounding dominates and an adaptive rule is the better tool.

pub fn new(n: usize) -> NumericResult<Self>

The n-point rule.

Errors

Refuses n == 0 and n > MAX_POINTS.

pub fn nodes(&self) -> &[f64]

Nodes on [-1, 1], ascending.

pub fn weights(&self) -> &[f64]

Weights matching nodes; they sum to 2.

pub fn apply<F: FnMut(f64) -> f64>( &self, f: F, lower: f64, upper: f64, ) -> NumericResult<f64>

Apply the rule to f on [lower, upper].

Errors

Refuses non-finite bounds and any non-finite value of f.

Trait Implementations

impl Clone for GaussLegendre

fn clone(&self) -> GaussLegendre

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for GaussLegendre

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

Formats the value using the given formatter.

impl PartialEq for GaussLegendre

fn eq(&self, other: &GaussLegendre) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for GaussLegendre