Related papers: A note on solutions of the matrix equation AXB=C

We derive closed formulas for the condition number of a linear function of the total least squares solution. Given an over determined linear system Ax=b, we show that this condition number can be computed using the singular values and the…

This paper proposes a verification method for sparse linear systems $Ax=b$ with general and nonsingular coefficients. A verification method produces the error bound for a given approximate solution. Conventional methods use one of two…

A necessary and sufficient condition for the simplicity of the C*-algebra reduced free product of finite dimensional abelian algebras is found, and it is proved that the stable rank of every such free product is 1. Related results about…

Let $A,B$ and $C$ be adjointable operators on a Hilbert $C^*$-module $\mathscr{E}$. Giving a suitable version of the celebrated Douglas theorem in the context of Hilbert $C^*$-modules, we present the general solution of the equation…

We define the notion of componentwise regularity and study some of its basic properties. We prove an analogue, when working with weight orders, of Buchberger's criterion to compute Gr\"obner bases; the proof of our criterion relies on a…

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

Consider the nonlinear matrix equation X-sum_{i=1}^{m}A_{i}^{*}X^{-1}A_{i}=Q. This paper shows that there exists a unique positive definite solution to the equation without any restriction on A_{i}. Three perturbation bounds for the unique…

In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…

We study the problem of approximating a matrix $\mathbf{A}$ with a matrix that has a fixed sparsity pattern (e.g., diagonal, banded, etc.), when $\mathbf{A}$ is accessed only by matrix-vector products. We describe a simple randomized…

Fast and accurate solutions of the Grad--Shafranov (GS) equation are essential for equilibrium analysis, integrated modeling, and surrogate model construction in magnetic confinement fusion. In this work, we address a fundamental question:…

Consider the affine space consisting of pairs of matrices $(A,B)$ of fixed size, and its closed subvariety given by the rank conditions $\operatorname{rank} A \leq a$, $\operatorname{rank} B \leq b$ and $\operatorname{rank} (A\cdot B) \leq…

This paper provides the best bounds to date on the number of randomly sampled entries required to reconstruct an unknown low rank matrix. These results improve on prior work by Candes and Recht, Candes and Tao, and Keshavan, Montanari, and…

In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…

We develop a family of reformulations of an arbitrary consistent linear system into a stochastic problem. The reformulations are governed by two user-defined parameters: a positive definite matrix defining a norm, and an arbitrary discrete…

We provide a sufficient condition for solvability of a system of real quadratic equations $p_i(x)=y_i$, $i=1, \ldots, m$, where $p_i: {\mathbb R}^n \longrightarrow {\mathbb R}$ are quadratic forms. By solving a positive semidefinite…

In [Q. Xu et al., The solutions to some operator equations, Linear Algebra Appl.(2008), doi:10.1016/j.laa.2008.05.034], Xu et al. provided the necessary and sufficient conditions for the existence of a solution to the equation…

We prove the existence of a positive semidefinite matrix $A \in \mathbb{R}^{n \times n}$ such that any decomposition into rank-1 matrices has to have factors with a large $\ell^1-$norm, more precisely $$ \sum_{k} x_k x_k^*=A \quad \implies…

In this paper, some useful necessary and sufficient conditions for the unique solution of the generalized absolute value equation (GAVE) $Ax-B|x|=b$ with $A, B\in \mathbb{R}^{n\times n}$ from the optimization field are first presented,…

We assume that all quark and lepton mass matrices have upper triangular form. Using all available experimental data on quark and lepton masses and mixing angles we make a fit in which we determine mass matrices elements. There are too many…

Let f be an analytic function defined on a complex domain Omega and A be a (n,n) complex matrix. We assume that there exists a unique alpha satisfying f(alpha)=0. When f'(alpha)=0 and A is non derogatory, we solve completely the equation…