RBFInterpolatorBuilder

Enum RBFInterpolatorBuilder 

Source
pub enum RBFInterpolatorBuilder<T, const DEGREE: usize, const MONOMIALS: usize, const POINTS: usize, const DIM: usize> {
    Linear,
    ThinPlateSpline,
    Cubic,
    Quintic,
    Multiquadratic {
        epsilon: T,
    },
    InverseMultiquadratic {
        epsilon: T,
    },
    InverseQuadratic {
        epsilon: T,
    },
    Gaussian {
        epsilon: T,
    },
}
Expand description

You must provide the number of monomials terms for your choice of polynomial degree and points dimension.

i.e. A degree 1 polynomial in two variables will incur the following monomials: 1, x, y Degree 2 will incur: 1, x, y, xy, x^2, y^2

In general, monomials = (degree + dimension) choose (degree)

Variants§

§

Linear

r

§

ThinPlateSpline

r^2 * log(r)

§

Cubic

r^3

§

Quintic

r^5

§

Multiquadratic

-sqrt(1 + r^2)

Fields

§epsilon: T
§

InverseMultiquadratic

1/sqrt(1 + r^2)

Fields

§epsilon: T
§

InverseQuadratic

1/(1 + r^2)

Fields

§epsilon: T
§

Gaussian

exp(-r^2)

Fields

§epsilon: T

Implementations§

Source§

impl<T, const DEGREE: usize, const MONOMIALS: usize, const POINTS: usize, const DIM: usize> RBFInterpolatorBuilder<T, DEGREE, MONOMIALS, POINTS, DIM>
where T: Scalar + RealField + Copy + Product,

Source

pub fn build<SP, SV>( self, points: Matrix<T, Const<DIM>, Const<POINTS>, SP>, values: Vector<T, Const<POINTS>, SV>, ) -> Option<RBFInterpolator<T, DEGREE, MONOMIALS, POINTS, DIM, SP, ArrayStorage<T, { _ }, 1>>>
where SP: Storage<T, Const<DIM>, Const<POINTS>>, SV: StorageMut<T, Const<POINTS>, U1>, Const<{ _ }>: DimMin<Const<{ _ }>, Output = Const<{ _ }>>,

Number of points with dimension provided as a matrix of collum vectors, with their values in a seperate vector.

Returns None when the linear system was not solveable. Will panic when the choice of added polynomial DEGREE and number of corresponding MONOMIAL terms are incompatible. Should satisfy: MONOMIAL = (DIM+DEGREE) choose DEGREE.

Auto Trait Implementations§

§

impl<T, const DEGREE: usize, const MONOMIALS: usize, const POINTS: usize, const DIM: usize> Freeze for RBFInterpolatorBuilder<T, DEGREE, MONOMIALS, POINTS, DIM>
where T: Freeze,

§

impl<T, const DEGREE: usize, const MONOMIALS: usize, const POINTS: usize, const DIM: usize> RefUnwindSafe for RBFInterpolatorBuilder<T, DEGREE, MONOMIALS, POINTS, DIM>
where T: RefUnwindSafe,

§

impl<T, const DEGREE: usize, const MONOMIALS: usize, const POINTS: usize, const DIM: usize> Send for RBFInterpolatorBuilder<T, DEGREE, MONOMIALS, POINTS, DIM>
where T: Send,

§

impl<T, const DEGREE: usize, const MONOMIALS: usize, const POINTS: usize, const DIM: usize> Sync for RBFInterpolatorBuilder<T, DEGREE, MONOMIALS, POINTS, DIM>
where T: Sync,

§

impl<T, const DEGREE: usize, const MONOMIALS: usize, const POINTS: usize, const DIM: usize> Unpin for RBFInterpolatorBuilder<T, DEGREE, MONOMIALS, POINTS, DIM>
where T: Unpin,

§

impl<T, const DEGREE: usize, const MONOMIALS: usize, const POINTS: usize, const DIM: usize> UnwindSafe for RBFInterpolatorBuilder<T, DEGREE, MONOMIALS, POINTS, DIM>
where T: UnwindSafe,

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
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

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> Same for T

Source§

type Output = T

Should always be Self
Source§

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

Source§

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

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

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

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

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
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.