Related papers: Cross product-free matrix pencils for computing ge…
Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…
A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…
We describe the inequalities on the possible eigenvalues of products of unitary matrices in terms of quantum Schubert calculus. Related problems are the existence of flat connections on the punctured two-sphere with prescribed holonomies,…
Given a matrix $A$, a matrix nearness problem seeks an $X$ that most closely approximates $A$ in the sense of minimizing $\lVert A - X\rVert$ under a variety of constraints on $X$. A generalized matrix nearness problem seeks the same but…
We show that any nonsingular (real or complex) square matrix can be factorized into a product of at most three normal matrices, one of which is unitary, another selfadjoint with eigenvalues in the open right half-plane, and the third one is…
Generalized equations are problems emerging in contexts of modern variational analysis as an adequate formalism to treat such issues as constraint systems, optimality and equilibrium conditions, variational inequalities, differential…
V. I. Arnold [Russian Math. Surveys 26, no. 2, 1971, 29-43] constructed smooth generic families of matrices with respect to similarity transformations depending smoothly on the entries of matrices and got bifurcation diagrams of such…
An algorithm for matrix factorization of polynomials was proposed in \cite{fomatati2022tensor} and it was shown that this algorithm produces better results than the standard method for factoring polynomials on the class of summand-reducible…
Recent work has highlighted the importance of crossed products in correctly elucidating the operator algebraic approach to quantum field theories. In the gravitational context, the crossed product simultaneously promotes von Neumann…
P. Van Dooren (1979) constructed an algorithm for computing all singular summands of Kronecker's canonical form of a matrix pencil. His algorithm uses only unitary transformations, which improves its numerical stability. We extend Van…
In this survey paper we study parametric versions of writing a matrix in $SL_n (\mathbb{C})$ as a product of lower and upper unitriangular matrices in interchanging order as well as generalizations to other classical groups. We give an…
It is known that singular values of idempotent matrices are either zero or larger or equal to one \cite{HouC63}. We state exactly how many singular values greater than one, equal to one, and equal to zero there are. Moreover, we derive a…
In this article, we are going to introduce the weighted numerical range which is a further generalization both the c-numerical range and the rank k numerical range. If the boundaries of weighted numerical ranges of two matrices (possibly of…
We introduce right eigenvalues and subeigenvalues for square dual complex matrices. An $n \times n$ dual complex Hermitian matrix has exactly $n$ right eigenvalues and subeigenvalues, which are all real. The Hermitian matrix is positive…
This study presents special cases of inconsistent pairwise comparisons PC matrices and analysis of their eigenvalue-based inconsistency index using mathematical methods. All studied special cases of PC matrices are Toeplitz matrices with…
We review methods to calculate eigenvalue distributions of products of large random matrices. We discuss a generalization of the law of free multiplication to non-Hermitian matrices and give a couple of examples illustrating how to use…
A new matrix product, called the semi-tensor product (STP), is briefly reviewed. The STP extends the classical matrix product to two arbitrary matrices. Under STP the set of matrices becomes a monoid (semi-group with identity). Some related…
The quadratic programming over one inequality quadratic constraint (QP1QC) is a very special case of quadratically constrained quadratic programming (QCQP) and attracted much attention since early 1990's. It is now understood that, under…
We establish the universality of the singular numbers in random matrix products over $\mathrm{GL}_n(\mathbb{Q}_p)$ as the number of products approaches infinity, with a fixed $n\ge 1$. We demonstrate that, under a broad class of…
In one complex variable, the cross ratio is a well-known quantity associated with four given points in the complex plane that remains invariant under linear fractional maps. In particular, if one knows where three points in the complex…