Skip to main content

ChunkedKernelDesignOperator

Struct ChunkedKernelDesignOperator 

Source
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 kernel_gauge restricts the kernel coefficient block through a Gauge section, so the effective design is [K_reduced | poly] instead of [K | poly].

Implementations§

Source§

impl<K: SpatialKernelEvaluator> ChunkedKernelDesignOperator<K>

Source

pub fn new( data: Arc<Array2<f64>>, centers: Arc<Array2<f64>>, kernel: K, kernel_gauge: Option<Arc<Gauge>>, poly_basis: Option<Arc<Array2<f64>>>, ) -> Result<Self, String>

Trait Implementations§

Source§

impl<K: SpatialKernelEvaluator> DenseDesignOperator for ChunkedKernelDesignOperator<K>

Source§

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>

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>

Materialize the full dense matrix. Operators that exist precisely to avoid materialization should still support this for fallback paths, diagnostics, and prediction.
Source§

fn compute_xtwy( &self, weights: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, y: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, ) -> Result<ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, String>

Source§

fn quadratic_form_diag( &self, middle: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 2]>>, ) -> Result<ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, String>

Source§

fn try_row_chunk( &self, rows: Range<usize>, ) -> Result<ArrayBase<OwnedRepr<f64>, Dim<[usize; 2]>>, MatrixMaterializationError>

Extract a dense row chunk without materializing the full matrix. Non-panicking owned-chunk API built on top of row_chunk_into.
Source§

fn apply_columns( &self, cols: &[usize], ) -> ArrayBase<OwnedRepr<f64>, Dim<[usize; 2]>>

Batched column extraction: returns an nrows × cols.len() dense block whose k-th column is apply(e_{cols[k]}). Read more
Source§

fn estimated_dense_bytes(&self) -> usize

Source§

fn try_to_dense_with_policy( &self, policy: &MaterializationPolicy, context: &'static str, ) -> Result<Arc<ArrayBase<OwnedRepr<f64>, Dim<[usize; 2]>>>, MatrixMaterializationError>

Source§

fn to_dense_arc(&self) -> Arc<ArrayBase<OwnedRepr<f64>, Dim<[usize; 2]>>>

Shared dense materialization via the required row-chunk API. Read more
Source§

impl<K: SpatialKernelEvaluator> LinearOperator for ChunkedKernelDesignOperator<K>

Source§

fn nrows(&self) -> usize

Source§

fn ncols(&self) -> usize

Source§

fn apply(&self, vector: &Array1<f64>) -> Array1<f64>

Source§

fn apply_transpose(&self, vector: &Array1<f64>) -> Array1<f64>

Source§

fn diag_xtw_x(&self, weights: &Array1<f64>) -> Result<Array2<f64>, String>

Source§

fn xt_diag_x_signed_op( &self, weights: SignedWeightsView<'_>, ) -> Result<ArrayBase<OwnedRepr<f64>, Dim<[usize; 2]>>, String>

Observed-Hessian / non-canonical-link Gram: XᵀWX with sign-honest weights. Returns a dense Array2<f64> because the result is symmetric but not guaranteed PSD (so consumers cannot assume the SymmetricMatrix PSD contract). Default impl delegates to diag_xtw_x for legacy operators; overriding impls may take a sign-aware fast path.
Source§

fn xt_diag_x_psd_op( &self, weights: PsdWeightsView<'_>, ) -> Result<SymmetricMatrix, String>

PSD-precondition Gram: XᵀWX with w ≥ 0 discharged at the PsdWeightsView constructor. Returns a typed SymmetricMatrix so downstream consumers can route through PSD-only solvers (Cholesky). Default impl wraps the signed path’s Array2 in SymmetricMatrix::Dense.
Source§

fn diag_gram( &self, weights: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, ) -> Result<ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, String>

Source§

fn apply_weighted_normal( &self, weights: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, vector: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, penalty: Option<&ArrayBase<OwnedRepr<f64>, Dim<[usize; 2]>>>, ridge: f64, ) -> ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>

Source§

fn uses_matrix_free_pcg(&self) -> bool

Source§

fn solve_system_matrix_free_pcg_try( &self, weights: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, rhs: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, penalty: Option<&ArrayBase<OwnedRepr<f64>, Dim<[usize; 2]>>>, baseridge: f64, ) -> Result<ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, String>

Source§

fn solve_system_matrix_free_pcg_with_info_try( &self, weights: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, rhs: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, penalty: Option<&ArrayBase<OwnedRepr<f64>, Dim<[usize; 2]>>>, baseridge: f64, ) -> Result<(ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, PcgSolveInfo), String>

Source§

fn factorize_system( &self, weights: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, penalty: Option<&ArrayBase<OwnedRepr<f64>, Dim<[usize; 2]>>>, ) -> Result<Box<dyn FactorizedSystem>, String>

Source§

fn solve_system( &self, weights: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, rhs: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, penalty: Option<&ArrayBase<OwnedRepr<f64>, Dim<[usize; 2]>>>, ) -> Result<ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, String>

Source§

fn solve_systemwith_policy( &self, weights: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, rhs: &ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, penalty: Option<&ArrayBase<OwnedRepr<f64>, Dim<[usize; 2]>>>, ridge_floor: f64, ridge_policy: RidgePolicy, ) -> Result<ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>, String>

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Allocation for T
where T: RefUnwindSafe + Send + Sync,

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> ByRef<T> for T

Source§

fn by_ref(&self) -> &T

Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> DistributionExt for T
where T: ?Sized,

Source§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

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> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

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 = Infallible

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

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

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.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V