Skip to main content

PiecewiseLegendrePoly

Struct PiecewiseLegendrePoly 

Source
pub struct PiecewiseLegendrePoly { /* private fields */ }
Expand description

A single piecewise Legendre polynomial

Implementations§

Source§

impl PiecewiseLegendrePoly

Source

pub fn new( data: Mat<f64>, knots: Vec<f64>, l: i32, delta_x: Option<Vec<f64>>, symm: i32, ) -> Result<PiecewiseLegendrePoly, Error>

Create a new PiecewiseLegendrePoly from data and knots

data holds the Legendre coefficients, one column per segment; the nsegments + 1 knots bound the segments. delta_x (the segment widths) is computed from the knots when None. symm is the parity of the polynomial: 1 (even), -1 (odd) or 0 (no definite parity).

§Errors
  • Error::EmptyInput if data has no row or no column
  • Error::InvalidParameter if knots does not have one entry more than data has columns, a knot is not finite, or a segment length knots[i] - knots[i - 1] is not a positive normal double (this includes decreasing knots, NaN, lengths that overflow and subnormal lengths); or if delta_x does not have one entry per segment or differs from the knot spacing e by more than max(1e-10 * |e|, 8 * f64::EPSILON * max(|knots[i]|, |knots[i + 1]|))
  • Error::InvalidParameter if symm is not -1, 0 or 1
Source

pub fn symm(&self) -> i32

Get the symmetry parameter

Source

pub fn rescale_domain( &self, new_knots: Vec<f64>, new_delta_x: Option<Vec<f64>>, new_symm: Option<i32>, ) -> Result<PiecewiseLegendrePoly, Error>

Rescale domain: create a new polynomial with the same data but different knots

This is useful for transforming from one domain to another, e.g., from x ∈ [-1, 1] to τ ∈ [0, β].

§Arguments
  • new_knots - New knot points
  • new_delta_x - Optional new segment widths (computed from knots if None)
  • new_symm - Optional new symmetry parameter (keeps old if None)
§Returns

New polynomial with rescaled domain

§Errors

The errors of new for the new knots and widths

Source

pub fn scale_data(&self, factor: f64) -> PiecewiseLegendrePoly

Scale all data values by a constant factor

This is useful for normalizations, e.g., multiplying by √β for Fourier transform preparations.

§Arguments
  • factor - Scaling factor to multiply all data by
§Returns

New polynomial with scaled data

Source

pub fn evaluate(&self, x: f64) -> f64

Evaluate the polynomial at a given point

§Panics

Panics if x is outside [xmin, xmax] or NaN; see Self::try_evaluate.

Source

pub fn try_evaluate(&self, x: f64) -> Result<f64, Error>

Self::evaluate returning an error instead of panicking

§Errors

Error::OutOfDomain if x is outside [xmin, xmax] or NaN

Source

pub fn evaluate_many(&self, xs: &[f64]) -> Vec<f64>

Evaluate the polynomial at multiple points

§Panics

Panics if a point is outside [xmin, xmax] or NaN; see Self::try_evaluate_many.

Source

pub fn try_evaluate_many(&self, xs: &[f64]) -> Result<Vec<f64>, Error>

Self::evaluate_many returning an error instead of panicking

§Errors

Error::OutOfDomain for the first point of xs that is outside [xmin, xmax] or NaN; no point is evaluated then

Source

pub fn split(&self, x: f64) -> (usize, f64)

Split x into segment index and normalized x

§Panics

Panics if x is outside [xmin, xmax] or NaN; see Self::try_split.

Source

pub fn try_split(&self, x: f64) -> Result<(usize, f64), Error>

Self::split returning an error instead of panicking

§Errors

Error::OutOfDomain if x is outside [xmin, xmax] or NaN

Source

pub fn evaluate_legendre_polynomial(&self, x: f64, coeffs: &[f64]) -> f64

Evaluate Legendre polynomial using recurrence relation

Source

pub fn deriv(&self, n: usize) -> PiecewiseLegendrePoly

Compute derivative of the polynomial

The result has polyorder equal to the number of its coefficient rows (at least 1).

Source

pub fn derivs(&self, x: f64) -> Vec<f64>

Compute derivatives at a point x

Returns the values of the derivatives of order 0 to polyorder - 1.

§Panics

Panics if x is outside [xmin, xmax] or NaN; see Self::try_derivs.

Source

pub fn try_derivs(&self, x: f64) -> Result<Vec<f64>, Error>

Self::derivs returning an error instead of panicking

§Errors

Error::OutOfDomain if x is outside [xmin, xmax] or NaN

Source

pub fn overlap<F>(&self, f: F) -> f64
where F: Fn(f64) -> f64,

Compute overlap integral with a function

Source

pub fn roots(&self) -> Vec<f64>

Find roots of the polynomial using C++ compatible algorithm

Source

pub fn get_xmin(&self) -> f64

Source

pub fn get_xmax(&self) -> f64

Source

pub fn get_l(&self) -> i32

Source

pub fn get_domain(&self) -> (f64, f64)

Source

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

Source

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

Source

pub fn get_symm(&self) -> i32

Source

pub fn get_data(&self) -> &Mat<f64>

Source

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

Source

pub fn get_polyorder(&self) -> usize

Trait Implementations§

Source§

impl Clone for PiecewiseLegendrePoly

Source§

fn clone(&self) -> PiecewiseLegendrePoly

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for PiecewiseLegendrePoly

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> ByRef<T> for T

§

fn by_ref(&self) -> &T

§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
§

impl<T> DistributionExt for T
where T: ?Sized,

§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<T> MaybeSend for T
where T: Send,

§

impl<T> MaybeSendSync for T
where T: Send + Sync,

§

impl<T> MaybeSync for T
where T: Sync,

§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V