Struct CompositeHyperOperator 

pub struct CompositeHyperOperator {
    pub dense: Option<Array2<f64>>,
    pub operators: Vec<Arc<dyn HyperOperator>>,
    pub dim_hint: usize,
}

Fields

dense: Option<Array2<f64>>

operators: Vec<Arc<dyn HyperOperator>>

dim_hint: usize

Trait Implementations

impl Clone for CompositeHyperOperator

fn clone(&self) -> CompositeHyperOperator

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl HyperOperator for CompositeHyperOperator

fn mul_mat(&self, factor: &Array2<f64>) -> Array2<f64>

Forward batched apply to inner operators so their mul_mat overrides (matrix-free Khatri–Rao BLAS3 fuses) fire instead of the default per-column parallel matvec — which would triple-nest rayon when an inner op already parallelizes internally.

fn as_any(&self) -> &(dyn Any + 'static)

Expose the concrete type for solver-local downcast helpers when the implementor has a 'static concrete type. Borrowing adapters may keep the default, which simply cannot downcast.

fn dim(&self) -> usize

Operator dimension p such that B · v consumes a p-vector and produces a p-vector.

fn mul_vec(&self, v: &Array1<f64>) -> Array1<f64>

Compute B · v (matrix-vector product). v and result are p-vectors.

fn mul_vec_view(&self, v: ArrayView1<'_, f64>) -> Array1<f64>

Compute B · v from a vector view.

fn mul_vec_into(&self, v: ArrayView1<'_, f64>, out: ArrayViewMut1<'_, f64>)

Compute B · v into caller-owned storage.

fn mul_basis_columns_into(&self, start: usize, out: ArrayViewMut2<'_, f64>)

Fill columns [start, start + out.ncols()) of B into out.

fn scaled_add_mul_vec( &self, v: ArrayView1<'_, f64>, scale: f64, out: ArrayViewMut1<'_, f64>, )

Accumulate scale * B · v into caller-owned storage.

fn trace_projected_factor(&self, factor: &Array2<f64>) -> f64

Compute trace(F^T B F) for a (p x k) factor matrix F.

fn trace_projected_factor_cached( &self, factor: &Array2<f64>, cache: &ProjectedFactorCache, ) -> f64

fn projected_matrix(&self, factor: &Array2<f64>) -> Array2<f64>

Compute the exact projected matrix F^T B F.

fn projected_matrix_cached( &self, factor: &Array2<f64>, cache: &ProjectedFactorCache, ) -> Array2<f64>

Compute the exact projected matrix F^T B F, reusing caller-owned projection caches when the operator has a shared row/design factor.

fn bilinear(&self, v: &Array1<f64>, u: &Array1<f64>) -> f64

Compute v^T · B · u (bilinear form).

fn bilinear_view(&self, v: ArrayView1<'_, f64>, u: ArrayView1<'_, f64>) -> f64

Compute v^T · B · u without requiring owned vector inputs.

fn to_dense(&self) -> Array2<f64>

Full dense materialization.

fn is_implicit(&self) -> bool

Whether this operator uses implicit (non-materialized) storage.

fn projection_design_id(&self) -> Option<usize>

Optional stable identity for this operator’s action B. When Some, the default cached trace / projected-matrix paths memoize the B · F product in the shared ProjectedFactorCache under a (design_id, factor) key, so repeated projections of the same factor against the same operator within one outer iteration build B · F once. None (the default) disables that reuse: an operator with no design factor stable across calls cannot key the cache without risking a stale B · F, so it recomputes every time.

fn has_fast_bilinear_view(&self) -> bool

Whether bilinear_view is implemented as a direct scalar contraction.

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

If this operator is block-local, returns the block range and local matrix.