Skip to main content

NonCentrosymmSVE

Struct NonCentrosymmSVE 

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

Non-centrosymmetric SVE computation

This strategy computes the kernel matrix directly over the full domain [xmin, xmax] × [ymin, ymax] given by the kernel’s SVEHints. No symmetry exploitation is performed, so it works for any kernel.

Centrosymmetric kernels are also expanded correctly, on the same segments of the full domain. The singular values then agree with CentrosymmSVE up to rounding, but the SVD is taken of a single matrix with twice as many rows and columns as each even/odd block, and the singular functions carry no parity tag.

The SVD sign gauge is fixed by demanding u_l(xmax) >= 0, as CentrosymmSVE does and as libsparseir’s SamplingSVE::postprocess does via canonicalize (convention-matched with backend/cxx/include/sparseir/impl/sve_impl.ipp, libsparseir commit 4bc58ea).

Implementations§

Source§

impl<T, K> NonCentrosymmSVE<T, K>
where T: CustomNumeric + Send + Sync + Clone + 'static, K: AbstractKernel + SVEKernel + Clone, K::SVEHintsType<T>: SVEHints<T> + Clone,

Source

pub fn new(kernel: K, epsilon: f64) -> Result<Self, Error>

Create a new NonCentrosymmSVE

§Errors

Error::InvalidParameter if the SVE hints of the kernel give segments that are not finite and strictly increasing, or that do not run from xmin to xmax (ymin to ymax). Hints written for the half domain [0, xmax] of sparse-ir 0.15 are rejected here: the SVE over their segments would expand only part of the kernel.

Trait Implementations§

Source§

impl<T, K> SVEStrategy<T> for NonCentrosymmSVE<T, K>
where T: CustomNumeric + Send + Sync + Clone + 'static, K: AbstractKernel + SVEKernel + Clone, K::SVEHintsType<T>: SVEHints<T> + Clone,

Source§

fn matrices(&self) -> Vec<Mat<T>>

Compute the discretized matrices for SVD
Source§

fn blocks(&self) -> Vec<KernelBlock<'_, T>>

The discretized, weighted kernel blocks to decompose, the matrices of Self::matrices with their entries evaluated on demand Read more
Source§

fn postprocess( &self, u_list: Vec<Mat<T>>, s_list: Vec<Vec<T>>, v_list: Vec<Mat<T>>, ) -> Result<SVEResult, Error>

Post-process SVD results to create SVEResult Read more

Auto Trait Implementations§

§

impl<T, K> Freeze for NonCentrosymmSVE<T, K>
where K: Freeze, <K as SVEKernel>::SVEHintsType<T>: Freeze, T: Freeze,

§

impl<T, K> RefUnwindSafe for NonCentrosymmSVE<T, K>

§

impl<T, K> Send for NonCentrosymmSVE<T, K>

§

impl<T, K> Sync for NonCentrosymmSVE<T, K>

§

impl<T, K> Unpin for NonCentrosymmSVE<T, K>
where K: Unpin, <K as SVEKernel>::SVEHintsType<T>: Unpin, T: Unpin,

§

impl<T, K> UnsafeUnpin for NonCentrosymmSVE<T, K>

§

impl<T, K> UnwindSafe for NonCentrosymmSVE<T, K>

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.