Algorithm 1011
From MaRDI portal
Publication:5025173
DOI10.1145/3408891zbMath1484.65090arXiv1812.03080OpenAlexW3088076341WikidataQ113309916 ScholiaQ113309916MaRDI QIDQ5025173
Publication date: 1 February 2022
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.03080
parallelizationjoint spectral radiusDaubechies waveletsnorm estimationinvariant polytope algorithmcapacity of codes
Numerical methods for wavelets (65T60) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical linear algebra (65F99)
Related Items (12)
The Barabanov Norm is Generically Unique, Simple, and Easily Computed ⋮ Stability of Continuous Time Linear Systems with Bounded Switching Intervals ⋮ On the length of switching intervals of a stable dynamical system ⋮ Computing the spectral gap of a family of matrices ⋮ Generalized Markov-Bernstein inequalities and stability of dynamical systems ⋮ Elliptic polytopes and invariant norms of linear operators ⋮ Optimal Switching Sequence for Switched Linear Systems ⋮ Spectrum Maximizing Products Are Not Generically Unique ⋮ An Irreducible Linear Switching System Whose Unique Barabanov Norm Is Not Strictly Convex ⋮ Joint spectral radius and ternary Hermite subdivision ⋮ Switching systems with dwell time: computing the maximal Lyapunov exponent ⋮ Bezout-like polynomial equations associated with dual univariate interpolating subdivision schemes
This page was built for publication: Algorithm 1011
