pub struct SamplingSVE<T>{ /* 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>
impl<T> SamplingSVE<T>
Sourcepub fn new(
segments_x: Vec<T>,
segments_y: Vec<T>,
gauss_x: Rule<T>,
gauss_y: Rule<T>,
epsilon: f64,
n_gauss: usize,
) -> Self
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.
Sourcepub fn postprocess_single(
&self,
u: &Mat<T>,
s: &[T],
v: &Mat<T>,
) -> Result<(PiecewiseLegendrePolyVector, Vec<f64>, PiecewiseLegendrePolyVector), Error>
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> 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
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.