Struct KroneckerFactoredBasis 

pub struct KroneckerFactoredBasis {
    pub marginal_designs: Vec<Array2<f64>>,
    pub marginal_penalties: Vec<Array2<f64>>,
    pub marginal_dims: Vec<usize>,
    pub has_double_penalty: bool,
    /* private fields */
}

Factored tensor-product basis metadata for operator-backed downstream use.

Fields

marginal_designs: Vec<Array2<f64>>

Marginal design matrices: marginal_designs[j] is (n, q_j).

marginal_penalties: Vec<Array2<f64>>

Marginal penalty matrices: marginal_penalties[k] is (q_k, q_k).

marginal_dims: Vec<usize>

Marginal basis dimensions: [q_0, ..., q_{d-1}].

has_double_penalty: bool

Whether the system includes a global ridge (double) penalty.

Implementations

impl KroneckerFactoredBasis

pub fn new( marginal_designs: Vec<Array2<f64>>, marginal_penalties: Vec<Array2<f64>>, marginal_dims: Vec<usize>, has_double_penalty: bool, ) -> Self

Construct from the fixed marginal data with an empty invariant cache.

pub fn invariant_structure( &self, ) -> Result<Arc<KroneckerInvariantStructure>, BasisError>

Lazily compute (once) and return the λ-invariant tensor structure (marginal eigensystems, reparameterized marginals, shrinkage scale).

Computed from the fixed marginal designs/penalties, so the result is the same on every call within a fit; the first call pays the eigh() cost and every later call is a pointer load. Because the cache is keyed on the fixed marginal data and marginal_penalties/marginal_designs are immutable for the fit’s lifetime, no invalidation is needed.

Trait Implementations

impl Clone for KroneckerFactoredBasis

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for KroneckerFactoredBasis

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.