Related papers: An Algorithmic Approach To Solving B = BCX + YAB U…
Matrix rank minimization problems are gaining a plenty of recent attention in both mathematical and engineering fields. This class of problems, arising in various and across-discipline applications, is known to be NP-hard in general. In…
Based on the geometric {\it Triangle Algorithm} for testing membership of a point in a convex set, we present a novel iterative algorithm for testing the solvability of a real linear system $Ax=b$, where $A$ is an $m \times n$ matrix of…
Randomized algorithms for low-rank matrix approximation are investigated, with the emphasis on the fixed-precision problem and computational efficiency for handling large matrices. The algorithms are based on the so-called QB factorization,…
Necessary and sufficient conditions are given on matrices $A$, $B$ and $S$, having entries in some field $\mathbb F$ and suitable dimensions, such that the linear span of the terms $A^iSB^j$ over $\mathbb F$ is equal to the whole matrix…
In this paper, we study the rank of matrices of bicomplex numbers. The relationship between rank, idempotent column rank and idempotent row rank is examined. Then, the solution of a system of equations in bicomplex space is presented using…
In this paper, we investigate a formula to solve systems of the form (B + {\sigma}I)x = y, where B is a limited-memory BFGS quasi-Newton matrix and {\sigma} is a positive constant. These types of systems arise naturally in large-scale…
In this paper we propose an efficiently preconditioned Newton method for the computation of the leftmost eigenpairs of large and sparse symmetric positive definite matrices. A sequence of preconditioners based on the BFGS update formula is…
The sufficient conditions for solvability of a linear Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ (with $a_1,a_2,...,a_n\in \mathbb{N}$) in non-negative integers $x_1,x_2,...,x_n$ are given. The explicit formulas are given for Frobenius…
In 2010, Eun-Young Lee conjectured that if $A,B$ are two $n\times n$ complex matrices and $\left|A\right|, \left|B\right|$ are the absolute values of $A, B$, respectively, then \[ \|A+B\|_F\le…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…
We present a new class of preconditioned iterative methods for solving linear systems of the form $Ax = b$. Our methods are based on constructing a low-rank Nystr\"om approximation to $A$ using sparse random matrix sketching. This…
In quant-ph/0205017 v1 Chen, Wu and Yang formulated a necessary separability criterion based on a realignment method for matrices. This note is to point out that this criterion is identical to the necessary cross norm criterion previously…
This work is concerned with the numerical solution of large-scale symmetric positive definite matrix equations of the form $A_1XB_1^\top + A_2XB_2^\top + \dots + A_\ell X B_\ell^\top = F$, as they arise from discretized partial differential…
Ranking, and inferences based on ranking of a set of entities, are important problems in numerous contexts. This is especially true in small area statistics where there may be only a limited amount of directly observed data from each entity…
In this paper we present the algorithm of finding the solutions of the equation $x^3+ax=b$ in $\mathbb{Z}^*_3$ with coefficients from $\mathbb{Q}_3$.
In this paper we study Frobenius bimodules between noncommutative spaces (quasi-schemes), developing some of their basic properties. If X and Y are spaces, we study those Frobenius X,Y-bimodules M satisfying properties that are natural in…
The solvability in Sobolev spaces is proved for divergence form complex-valued higher order parabolic systems in the whole space, on a half space, and on a Reifenberg flat domain. The leading coefficients are assumed to be merely measurable…
Computational methods are an important tool for solving the Yang-Baxter equations(in small dimensions), for classifying (unifying) structures, and for solving related problems. This paper is an account of some of the latest developments on…
We prove the solvability in Sobolev spaces for both divergence and non-divergence form higher order parabolic and elliptic systems in the whole space, on a half space, and on a bounded domain. The leading coefficients are assumed to be…
In this work, we present scalable balancing domain decomposition by constraints methods for linear systems arising from arbitrary order edge finite element discretizations of multi-material and heterogeneous 3D problems. In order to enforce…