Skip to main content

SamplingSVE

Struct SamplingSVE 

Source
pub struct SamplingSVE<T>
where T: CustomNumeric + Send + Sync + 'static,
{ /* private fields */ }
Expand description

Sampling-based SVE computation

This is the general SVE computation strategy that works with discretized kernels. It does NOT know about symmetry - it just processes a given discretized kernel matrix.

§Responsibility

  • Remove weights from SVD results
  • Convert to polynomials on the domain specified by segments
  • Domain extension is caller’s responsibility

Implementations§

Source§

impl<T> SamplingSVE<T>
where T: CustomNumeric + Send + Sync + 'static,

Source

pub fn new( segments_x: Vec<T>, segments_y: Vec<T>, gauss_x: Rule<T>, gauss_y: Rule<T>, epsilon: f64, n_gauss: usize, ) -> Self

Create a new SamplingSVE

This takes only the geometric information needed for polynomial conversion, not the kernel itself.

Source

pub fn postprocess_single( &self, u: &Mat<T>, s: &[T], v: &Mat<T>, ) -> Result<(PiecewiseLegendrePolyVector, Vec<f64>, PiecewiseLegendrePolyVector), Error>

Post-process a single SVD result to create polynomials

This converts SVD results to piecewise Legendre polynomials on the domain specified by segments (e.g., [0, xmax] for reduced kernels).

§Errors

The errors of the crate-internal svd_to_polynomials, and Error::EmptyInput if the SVD result has no singular values

Auto Trait Implementations§

§

impl<T> Freeze for SamplingSVE<T>
where T: Freeze,

§

impl<T> RefUnwindSafe for SamplingSVE<T>
where T: RefUnwindSafe,

§

impl<T> Send for SamplingSVE<T>

§

impl<T> Sync for SamplingSVE<T>

§

impl<T> Unpin for SamplingSVE<T>
where T: Unpin,

§

impl<T> UnsafeUnpin for SamplingSVE<T>
where T: UnsafeUnpin,

§

impl<T> UnwindSafe for SamplingSVE<T>
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
§

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, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

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

fn try_from(value: U) -> Result<T, !>

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.