pub struct KernelBlock<'a, T> { /* private fields */ }Expand description
A discretized, weighted kernel matrix A[i, j] = K(x_i, y_j) √w_i √w'_j
(Gauss points x_i, y_j, weights w_i, w'_j) whose entries are
evaluated on demand
The SVD of the double-double SVE, by adaptive cross approximation, only
touches a few rows and columns of A, so the matrix is not formed.
Implementations§
Auto Trait Implementations§
impl<'a, T> !RefUnwindSafe for KernelBlock<'a, T>
impl<'a, T> !Send for KernelBlock<'a, T>
impl<'a, T> !UnwindSafe for KernelBlock<'a, T>
impl<'a, T> Freeze for KernelBlock<'a, T>
impl<'a, T> Sync for KernelBlock<'a, T>
impl<'a, T> Unpin for KernelBlock<'a, T>
impl<'a, T> UnsafeUnpin for KernelBlock<'a, T>
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.