Related papers: Characterizing matrices with $X$-simple image eige…
The Rayleigh-Ritz method is widely used for eigenvalue approximation. Given a matrix $X$ with columns that form an orthonormal basis for a subspace $\X$, and a Hermitian matrix $A$, the eigenvalues of $X^HAX$ are called Ritz values of $A$…
We show that for algebraic groups over local fields of characteristic zero, the following are equivalent: Every homomorphism has a closed image, every unitary representation decomposes into a direct sum of finite-dimensional and mixing…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
Random matrix theory allows for the deduction of stability criteria for complex systems using only a summary knowledge of the statistics of the interactions between components. As such, results like the well-known elliptical law are…
Image structure-texture decomposition is a long-standing and fundamental problem in both image processing and computer vision fields. In this paper, we propose a generalized semi-sparse regularization framework for image structural analysis…
Random matrix models based on an integral over supermatrices are proposed as a natural extension of bosonic matrix models. The subtle nature of superspace integration allows these models to have very different properties from the analogous…
The problem of finding the maximal dimension of linear or affine subspaces of matrices whose rank is constant, or bounded below, or bounded above, has attracted many mathematicians from the sixties to the present day. The problem has caught…
A matrix is \emph{simple} if it is a (0,1)-matrix and there are no repeated columns. Given a (0,1)-matrix $F$, we say a matrix $A$ has $F$ as a \emph{configuration}, denoted $F\prec A$, if there is a submatrix of $A$ which is a row and…
Spectral measures give rise to a natural harmonic analysis on the unit disc via a boundary representation of a positive matrix arising from a spectrum of the measure. We consider in this paper the reverse: for a positive matrix in the Hardy…
Alternating Minimization is a widely used and empirically successful heuristic for matrix completion and related low-rank optimization problems. Theoretical guarantees for Alternating Minimization have been hard to come by and are still…
We propose an information-theoretic framework for matrix completion. The theory goes beyond the low-rank structure and applies to general matrices of "low description complexity". Specifically, we consider $m\times n$ random matrices…
Matrix equations are omnipresent in (numerical) linear algebra and systems theory. Especially in model order reduction (MOR) they play a key role in many balancing based reduction methods for linear dynamical systems. When these systems…
In this paper, we introduce and characterize max-doubly stochastic matrices within the framework of max algebra, where the operations are defined as $x \oplus y = \max(x, y)$ and $x \otimes y = xy$. We explore the fundamental properties of…
The max-Lukasiewicz semiring is defined as the unit interval [0,1] equipped with the arithmetics "a+b"=max(a,b) and "ab"=max(0,a+b-1). Linear algebra over this semiring can be developed in the usual way. We observe that any problem of the…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
We consider square matrices over $\mathbb{C}$ satisfying an identity relating their eigenvalues and the corresponding eigenvectors re-proved and discussed by Denton, Parker, Tao and Zhang, called the eigenvector-eigenvalue identity. We…
In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$…
Maxmin-$\omega$ dynamical systems were previously introduced as an ``all-in-one package'' that can yield a solely min-plus, a solely max-plus, or a max-min-plus dynamical system by varying a parameter $\omega\in(0,1]$. With such systems in…
The aim of this note is to provide a conceptually simple demonstration of the fact that repetitive model sets are characterized as the repetitive Meyer sets with an almost automorphic associated dynamical system.
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…