Computing powers of interval matrices is a computationally hard problem. Indeed, it is NP-hard even when the exponent is 3 and the matrices only have interval components in one row and one column. Motivated by this result, we consider special types of interval matrices where the interval components occupy specific positions. We show that computing the third power of matrices with only one column occupied by interval components can be solved in cubic time; so the asymptotic time complexity is the...

We introduce a method to compute rigorous component-wise enclosures of discrete convolutions using the fast Fourier transform, the properties of Banach algebras, and interval arithmetic. The purpose of this new approach is to improve the implementation and the applicability of computer-assisted proofs performed in weighed ${\ell }^1$ Banach algebras of Fourier/Chebyshev sequences, whose norms are known to be numerically unstable. We introduce some application examples, in particular a rigorous aposteriori...

A general framework for computing robust controllable sets of constrained nonlinear uncertain discrete-time systems as well as controlling such complex systems based on the computed robust controllable sets is introduced in this paper. The addressed one-step control approach turns out to be a robust model predictive control scheme with feasible unit control horizon and contractive constraint. The solver of 1-dimensional quantified set inversion in modal interval analysis is extended to 2-dimensional...