Related papers: Equivalent matrices up to permutations

Encrypted computation opens up promising avenues across a plethora of application domains, including machine learning, health-care, finance, and control. Arithmetic homomorphic encryption, in particular, is a natural fit for cloud-based…

Let $m$ be any integer $\geq 3$. We consider the polynomial equation $$X^n + a_{n-1}\cdot X^{n-1} + \dots + a_1 \cdot X + a_0 \cdot I = O,$$ over $(m \times m)$-matrices $X$ with the real entries, where $I$ is the identity matrix, $O$ is…

Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether all convex combinations of k matrices in R^{n x n} are stable. In particular, we are interested whether there exist…

Let $\mathbf{f}=(f\_1,\ldots,f\_m)$ and $\mathbf{g}=(g\_1,\ldots,g\_m)$ be two sets of $m\geq 1$ nonlinear polynomials over $\mathbb{K}[x\_1,\ldots,x\_n]$ ($\mathbb{K}$ being a field). We consider the computational problem of finding -- if…

In an underdetermined system of equations $Ax=y$, where $A$ is an $m\times n$ matrix, only $u$ of the entries of $y$ with $u < m$ are known. Thus $E_jw$, called `measurements', are known for certain $j\in J \subset \{0,1,\ldots,m-1\}$ where…

The matrix code equivalence problem consists, given two matrix spaces $\mathcal{C},\mathcal{D} \subset \mathbb{F}_q^{m\times n}$ of dimension $k$, in finding invertible matrices $P\in\mathrm{GL}_m(\mathbb{F}_q)$ and…

Consider an integer associated with every subset of the set of columns of an $n\times k$ matrix. The collection of those matrices for which the rank of a union of columns is the predescribed integer for every subset, will be denoted by…

Sequences of parametrized Lyapunov equations can be encountered in many application settings. Moreover, solutions of such equations are often intermediate steps of an overall procedure whose main goal is the computation of…

On the math-fun mailing list (7 May 2013), Neil Sloane asked to calculate the number of $n \times n$ matrices with entries in $\{0,1\}$ which are squares of other such matrices. In this paper we analyze the case that the arithmetic is in…

We consider the polynomial equation $$X^n + a_{n-1}\cdot X^{n-1} + \dots + a_1 \cdot X + a_0 \cdot I = O,$$ over $(2 \times 2)$-matrices $X$ with the real entries, where $I$ is the identity matrix, $O$ is the null matrix, $a_i \in \mathbb…

Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admits unfoldings to skew-symmetric matrices. We develop an combinatorial algorithm that…

We show that assuming the availability of the processor with variable precision arithmetic, we can compute matrix-by-matrix multiplications in $O(N^2log_2N)$ computational complexity. We replace the standard matrix-by-matrix multiplications…

In the field of robotics research, a crucial applied problem is the hand-eye calibration issue, which involves solving the matrix equation $AX = YB$. However, this matrix equation is merely a specific case of the more general dual…

Invariance transformations of polyadic decompositions of matrix multiplication tensors define an equivalence relation on the set of such decompositions. In this paper, we present an algorithm to efficiently decide whether two polyadic…

This paper studies the solvability, existence of unique solution, closed-form solution and numerical solution of matrix equation $X=Af(X) B+C$ with $f(X) =X^{\mathrm{T}},$ $f(X) =\bar{X}$ and $f(X) =X^{\mathrm{H}},$ where $X$ is the…

Let $\mathbb{N}$ be the set of all positive integers and let $a,\, b,\, c$ be nonzero integers such that $\gcd\left(a,\, b,\, c\right)=1$. In this paper, we prove the following three results: (1) the solvability of the matrix equation…

Matrix scaling and matrix balancing are two basic linear-algebraic problems with a wide variety of applications, such as approximating the permanent, and pre-conditioning linear systems to make them more numerically stable. We study the…

In this paper, we study quantum algorithms of matrix multiplication from the viewpoint of inputting quantum/classical data to outputting quantum/classical data. The main target is trying to overcome the input and output problem, which are…

We present a new algorithm for solving an eigenvalue problem for a real symmetric matrix which is a rank-one modification of a diagonal matrix. The algorithm computes each eigenvalue and all components of the corresponding eigenvector with…

We present a general scheme for the construction of new eficient generalized Schultz iterative methods for computing the inverse matrix. These methods have the form $$ X_{k+1} = X_k(a_0^{(k)}I+a_1^{(k)}AX_k),\quad k\in\mathbb{N}, $$ where…