Related papers: Efficient Method for Computing Lower Bounds on the…
In this paper we show a characterization of the joint spectral radius of a set of matrices as the limit of the $p$-radius of an associated probability distribution when $p$ tends to $\infty$. Allowing the set to have infinitely many…
We investigate the stabilizability of linear discrete-time switched systems with singular matrices, focusing on the spectral radius in this context. A new lower bound of the stabilizability radius is proposed, which is applicable to any…
We present a new method for obtaining norm bounds for random matrices, where each entry is a low-degree polynomial in an underlying set of independent real-valued random variables. Such matrices arise in a variety of settings in the…
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…
Determining the induced L2 norm of a linear, parameter-varying (LPV) system is an integral part of many analysis and robust control design procedures. Most prior work has focused on efficiently computing upper bounds for the induced L2…
This paper studies the constrained switching (linear) system which is a discrete-time switched linear system whose switching sequences are constrained by a deterministic finite automaton. The stability of a constrained switching system is…
In this paper we develop algorithms for approximating matrix multiplication with respect to the spectral norm. Let A\in{\RR^{n\times m}} and B\in\RR^{n \times p} be two matrices and \eps>0. We approximate the product A^\top B using two…
This paper is concerned with the analysis of the randomized subspace iteration for the computation of low-rank approximations. We present three different kinds of bounds. First, we derive both bounds for the canonical angles between the…
In this paper, we give upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and characterize the equality cases. These bounds theoretically improve and generalize some known results of Duan et al.[X. Duan, B.…
We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…
We consider the problem of estimating the spectral norm of a matrix using only matrix-vector products. We propose a new Counterbalance estimator that provides upper bounds on the norm and derive probabilistic guarantees on its…
With the objective of developing computational methods for stability analysis of switched systems, we consider the problem of finding the minimal lower bounds on average dwell-time that guarantee global asymptotic stability of the origin.…
This article focuses on Lp-estimates for the square root of elliptic systems of second order in divergence form on a bounded domain. We treat complex bounded measurable coefficients and allow for mixed Dirichlet/Neumann boundary conditions…
Optimization problems over permutation matrices appear widely in facility layout, chip design, scheduling, pattern recognition, computer vision, graph matching, etc. Since this problem is NP-hard due to the combinatorial nature of…
This paper investigates the robustness of exponential stability of a class of switched systems described by linear functional differential equations under arbitrary switching. We will measure the stability robustness of such a system,…
This paper is concerned with the analysis of the $L_p\ (p\in[1,\infty), p=\infty)$ induced norms of continuous-time linear systems where input signals are restricted to be nonnegative. This norm is referred to as the $L_{p+}$ induced norm…
In this paper, we study linear backward parabolic SPDEs in bounded domains and present new a priori estimates for their weak solutions. Inspired by the seminal work of Y. Hu, J. Ma and J. Yong from 2002 on strong solutions, we establish…
We develop a new refinement of the Kato's inequality and using this refinement we obtain several upper bounds for the numerical radius of a bounded linear operator as well as the product of operators, which improve the well known existing…
The structured $\varepsilon$-stability radius is introduced as a quantity to assess the robustness of transient bounds of solutions to linear differential equations under structured perturbations of the matrix. This applies to general…
We present algorithms for efficiently learning regularizers that improve generalization. Our approach is based on the insight that regularizers can be viewed as upper bounds on the generalization gap, and that reducing the slack in the…