相关论文: On the distance from a matrix polynomial to matrix…

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…

Recently, Stull [18], [17] resolved a long-standing open problem posed by Lutz, on whether the set of effective Hausdorff dimensions of points on a straight line in $\mathbb{R}^2$ -- the effective dimension spectrum of the line -- contains…

Given an $n\times n$ matrix with integer entries in the range $[-h,h]$, how close can two of its distinct eigenvalues be? The best previously known examples have a minimum gap of $h^{-O(n)}$. Here we give an explicit construction of…

Given a matrix $A \in \mathbb{R}^{m\times d}$ with singular values $\sigma_1\geq \cdots \geq \sigma_d$, and a random matrix $G \in \mathbb{R}^{m\times d}$ with iid $N(0,T)$ entries for some $T>0$, we derive new bounds on the Frobenius…

Suppose $\left \{ X_{i,k}; 1\le i \le p, 1\le k \le n \right \} $ is an array of i.i.d.~real random variables. Let $\left \{ p=p_{n}; n \ge1 \right \} $ be positive integers. Consider the maximum interpoint distance $M_{n}=\max_{1\le i<…

The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This quantity appears in a number of application contexts but is…

We propose a new approach to the spectral theory of perturbed linear operators , in the case of a simple isolated eigenvalue. We obtain two kind of results: ''radius bounds'' which ensure perturbation theory applies for perturbations up to…

First, we derive explicit computable expressions of structured backward errors of approximate eigenelements of structured matrix polynomials including symmetric, skew-symmetric, Hermitian, skew-Hermitian, even and odd polynomials. We also…

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…

In many robotics applications, it is necessary to compute not only the distance between the robot and the environment, but also its derivative - for example, when using control barrier functions. However, since the traditional Euclidean…

We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…

Given multiple orthogonal polynomials on the real line with respect to a system $\bm{\mu} = (\mu_1,\ldots,\mu_r)$, we investigate multiple orthogonal polynomials associated with any rational perturbation of the form $$…

Let $T=t_0 ... t_{n-1}$ be a text and $P = p_0 ... p_{m-1}$ a pattern taken from some finite alphabet set $\Sigma$, and let $\dist$ be a metric on $\Sigma$. We consider the problem of calculating the sum of distances between the symbols of…

We find out a method for symbolic estimation of a minimal (maximal) distance between eigenvalues of a Hermitian matrix (or roots of a polynomial with real (maybe degenerated) roots), using Hankel matrices formalism. The range of location of…

Given two $d\times d$ matrices, say $A$ and $B$, when do $p(A)$ and $p(B)$ have the same ``size'' for every polynomial $p$? In this article, we provide definitive results in the cases $d=2$ and $d=3$ when the notion of size used is the…

This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give…

In this paper we bring to light an unprecedented property of the eigenvalues of a matrix A with the eigenvalues and eigenvectors of a submatrix of A. This property can be used, through the technique developed here, to determine some of…

The matrix spectral and nuclear norms appear in enormous applications. The generalizations of these norms to higher-order tensors is becoming increasingly important but unfortunately they are NP-hard to compute or even approximate. Although…