pub struct ChunkedKernelDesignOperator<K: SpatialKernelEvaluator> { /* private fields */ }Expand description
Chunked kernel design operator for spatial smooths (TPS, Matérn, Duchon).
Instead of storing a dense n × k matrix, evaluates K(data[i], center[j]) on-the-fly in row chunks. Memory usage is O(chunk_size × k) instead of O(n × k).
The optional poly_basis appends polynomial columns after the kernel columns
(e.g., linear polynomial for TPS identifiability).
The optional constraint_transform applies a column-space projection Z
such that the effective design is [K * Z | poly] instead of [K | poly].
Implementations§
Trait Implementations§
Source§impl<K: SpatialKernelEvaluator> DenseDesignOperator for ChunkedKernelDesignOperator<K>
impl<K: SpatialKernelEvaluator> DenseDesignOperator for ChunkedKernelDesignOperator<K>
Source§fn as_dense_ref(&self) -> Option<&Array2<f64>>
fn as_dense_ref(&self) -> Option<&Array2<f64>>
Expose the cached [K_eff | poly] materialization so cross-block paths can use the Dense × Dense BLAS-3 fast path instead of falling back to chunked scalar accumulation.
Source§fn row_chunk_into(
&self,
rows: Range<usize>,
out: ArrayViewMut2<'_, f64>,
) -> Result<(), MatrixMaterializationError>
fn row_chunk_into( &self, rows: Range<usize>, out: ArrayViewMut2<'_, f64>, ) -> Result<(), MatrixMaterializationError>
Fill a dense row chunk without materializing the full matrix.
Required: every implementor must provide row-local access here.
Source§fn to_dense(&self) -> Array2<f64>
fn to_dense(&self) -> Array2<f64>
Materialize the full dense matrix. Operators that exist precisely to
avoid materialization should still support this for fallback paths,
diagnostics, and prediction.
fn compute_xtwy( &self, weights: &Array1<f64>, y: &Array1<f64>, ) -> Result<Array1<f64>, String>
fn quadratic_form_diag( &self, middle: &Array2<f64>, ) -> Result<Array1<f64>, String>
Source§fn try_row_chunk(
&self,
rows: Range<usize>,
) -> Result<Array2<f64>, MatrixMaterializationError>
fn try_row_chunk( &self, rows: Range<usize>, ) -> Result<Array2<f64>, MatrixMaterializationError>
Extract a dense row chunk without materializing the full matrix.
Non-panicking owned-chunk API built on top of
row_chunk_into.fn estimated_dense_bytes(&self) -> usize
fn try_to_dense_with_policy( &self, policy: &MaterializationPolicy, context: &'static str, ) -> Result<Arc<Array2<f64>>, MatrixMaterializationError>
Source§impl<K: SpatialKernelEvaluator> LinearOperator for ChunkedKernelDesignOperator<K>
impl<K: SpatialKernelEvaluator> LinearOperator for ChunkedKernelDesignOperator<K>
fn nrows(&self) -> usize
fn ncols(&self) -> usize
fn apply(&self, vector: &Array1<f64>) -> Array1<f64>
fn apply_transpose(&self, vector: &Array1<f64>) -> Array1<f64>
fn diag_xtw_x(&self, weights: &Array1<f64>) -> Result<Array2<f64>, String>
fn diag_gram(&self, weights: &Array1<f64>) -> Result<Array1<f64>, String>
fn apply_weighted_normal( &self, weights: &Array1<f64>, vector: &Array1<f64>, penalty: Option<&Array2<f64>>, ridge: f64, ) -> Array1<f64>
fn uses_matrix_free_pcg(&self) -> bool
fn solve_system_matrix_free_pcg_try( &self, weights: &Array1<f64>, rhs: &Array1<f64>, penalty: Option<&Array2<f64>>, baseridge: f64, ) -> Result<Array1<f64>, String>
fn solve_system_matrix_free_pcg_with_info_try( &self, weights: &Array1<f64>, rhs: &Array1<f64>, penalty: Option<&Array2<f64>>, baseridge: f64, ) -> Result<(Array1<f64>, PcgSolveInfo), String>
fn factorize_system( &self, weights: &Array1<f64>, penalty: Option<&Array2<f64>>, ) -> Result<Box<dyn FactorizedSystem>, String>
fn solve_system( &self, weights: &Array1<f64>, rhs: &Array1<f64>, penalty: Option<&Array2<f64>>, ) -> Result<Array1<f64>, String>
fn solve_systemwith_policy( &self, weights: &Array1<f64>, rhs: &Array1<f64>, penalty: Option<&Array2<f64>>, ridge_floor: f64, ridge_policy: RidgePolicy, ) -> Result<Array1<f64>, String>
fn matvec(&self, vector: &Array1<f64>) -> Array1<f64>
fn matvec_trans(&self, vector: &Array1<f64>) -> Array1<f64>
fn compute_xtwx(&self, weights: &Array1<f64>) -> Result<Array2<f64>, String>
Auto Trait Implementations§
impl<K> !Freeze for ChunkedKernelDesignOperator<K>
impl<K> RefUnwindSafe for ChunkedKernelDesignOperator<K>where
K: RefUnwindSafe,
impl<K> Send for ChunkedKernelDesignOperator<K>
impl<K> Sync for ChunkedKernelDesignOperator<K>
impl<K> Unpin for ChunkedKernelDesignOperator<K>where
K: Unpin,
impl<K> UnsafeUnpin for ChunkedKernelDesignOperator<K>where
K: UnsafeUnpin,
impl<K> UnwindSafe for ChunkedKernelDesignOperator<K>where
K: 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
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.