Hankel
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Robust and efficient data-driven predictive control
arXiv:2409.18867v2 Announce Type: replace Abstract: We propose a robust and efficient data-driven predictive control (eDDPC) scheme which is more sample efficient (requires less offline data) compared to existing schemes, and is also computationally efficient. This scheme employs a recently proposed data-based representation of linear time-invariant (LTI) systems as a predictor. Such a representation serves as an alternative to Hankel-based predictors obtained from, e.g., the so-called...
Block Jacobi/Gauss-Seidel preconditioning for GLT sequences, and GLH sequences
arXiv:2606.01888v1 Announce Type: new Abstract: The theory of generalized locally Toeplitz (GLT) sequences is an apparatus for computing the spectral and singular value distribution of sequences of matrices that possess a (possibly hidden) Toeplitz-like structure.
Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
arXiv:2606.02263v1 Announce Type: new Abstract: We study exact uniform sampling of permutations of length $n$ whose longest increasing subsequence (LIS) has prescribed length $k$. For $k \in \Theta(n)$, we give a direct rejection sampler whose expected running time is $O(n\log\log n)$ in the word-RAM model. The sampler uses an expanded proposal space consisting of permutations together with a specified increasing subsequence, and accepts exactly those proposals whose specified subsequence is...
Structure-Informed Bounds on the Kronecker Rank of Block-Structured Matrices
arXiv:2605.30908v1 Announce Type: new Abstract: We derive theoretical bounds on the Kronecker rank of block-structured matrices that possess both inner and outer structure. Building on the matrix-to-tensor and tensor-to-matrix framework of Kilmer and Saibaba ($\textit{SIAM J. Matrix Anal.