A hybrid principal-vector pruning method is proposed to refine invariant subspaces for Koopman approximations, supported by error bounds on eigenfunction retention and a rank-one update scheme for efficient computation.
Conformal on- line learning of deep Koopman linear embeddings
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Subspace Pruning via Principal Vectors for Accurate Koopman-Based Approximations
A hybrid principal-vector pruning method is proposed to refine invariant subspaces for Koopman approximations, supported by error bounds on eigenfunction retention and a rank-one update scheme for efficient computation.