pub struct LegendrePolynomial;Expand description
Legendre polynomials P_n(x) and Gauss-Legendre quadrature.
Provides evaluation via the three-term recurrence, computation of all P_0, …, P_n, and Gauss-Legendre nodes and weights up to degree n.
Implementations§
Source§impl LegendrePolynomial
impl LegendrePolynomial
Sourcepub fn eval_all(n: usize, x: f64) -> Vec<f64>
pub fn eval_all(n: usize, x: f64) -> Vec<f64>
Evaluate P_0(x), …, P_n(x) and return all values.
Auto Trait Implementations§
impl Freeze for LegendrePolynomial
impl RefUnwindSafe for LegendrePolynomial
impl Send for LegendrePolynomial
impl Sync for LegendrePolynomial
impl Unpin for LegendrePolynomial
impl UnsafeUnpin for LegendrePolynomial
impl UnwindSafe for LegendrePolynomial
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.