Related papers: Solution of Linear Systems of Equations Ax=b and A…
In this article we consider a consistent matrix equation $AXB = C$ when a particular solution $X_{0}$ is given and we represent a new form of the general solution which contains both reproductive and non-reproductive solutions (it depends…
We consider the solution of systems of linear algebraic equations (SLAEs) with an ill-conditioned or degenerate exact matrix and an approximate right-hand side. An approach to solving such a problem is proposed and justified, which makes it…
Several preconditioned AOR methods have been proposed to solve system of linear equations $Ax=b$, where $A \in \mathbb{R}^{n \times n}$ is a unit Z-matrix. The aim of this paper is to give a comparison result for a class of preconditioners…
We discuss, by topological methods, the solvability of systems of second-order elliptic differential equations subject to functional boundary conditions under the presence of gradient terms in the nonlinearities. We prove the existence of…
On the set of mappings of the given set, we define the product of mappings. If A is associative algebra, then we consider the set of matrices, whose elements are linear mappings of algebra A. In algebra of matrices of linear mappings we…
This paper investigates the distributed computation of the well-known linear matrix equation in the form of $AXB = F$, with the matrices A, B, X, and F of appropriate dimensions, over multi-agent networks from an optimization perspective.…
Integral linear systems $Ax=b$ with matrices $A$, $b$ and solutions $x$ are also required to be in integers, can be solved using invariant factors of $A$ (by computing the Smith Canonical Form of $A$). This paper explores a new problem…
Solving quadratic equations over finite fields is a fundamental task in algebraic coding theory and serves as a key subroutine for computing the roots of cubic and quartic polynomials. Notably, any quadratic polynomial over binary extension…
Matrix--vector algorithms, particularly Krylov subspace methods, are widely viewed as the most effective algorithms for solving large systems of linear equations. This paper establishes lower bounds on the worst-case number of…
In this paper, we present and analyze methods for solving a system of linear equations over idempotent semifields. The first method is based on the pseudo-inverse of the system matrix. We then present a specific version of Cramer's rule…
An optimum solution free from degeneration is found to the system of linear algebraic equations with empirical coefficients and right-hand sides. The quadratic risk of estimators of the unknown solution vector is minimized over a class of…
A novel approach for solving linear estimation problem in multi-user massive MIMO systems is proposed. In this approach, the difficulty of matrix inversion is attributed to the incomplete definition of the dot product. The general…
This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…
Flexible systems are linear systems of inclusions in which the elements of the coefficient matrix are external numbers in the sense of nonstandard analysis. External numbers represent real numbers with small, individual error terms. Using…
A general formalism to solve nonlinear differential equations is given. Solutions are found and reduced to those of second order nonlinear differential equations in one variable. The approach is uniformized in the geometry and solves…
This note is concerned with the linear matrix equation $X = AX^\top B + C$, where the operator $(\cdot)^\top$ denotes the transpose ($\top$) of a matrix. The first part of this paper set forth the necessary and sufficient conditions for the…
In this paper, we derive a formula to compute the solution of the linear matrix equation $X=Af(X)B+C$ via finding any solution of a specific Stein matrix equation $\mathcal{X}=\mathcal{A} \mathcal{X} \mathcal{B}+\mathcal{C}$, where the…
In this paper we represent a new form of condition for the consistency of the matrix equation AXB=C. If the matrix equation AXB=C is consistent, we determine a form of general solution which contains both reproductive and non-reproductive…
For arbitrary F-algebra, in which the operation of addition is defined, I explore biring of matrices of mappings. The sum of matrices is determined by the sum in F-algebra, and the product of matrices is determined by the product of…
For $N\geq 3$ and non-negative real numbers $a_{ij}$ and $b_{ij}$ ($i,j= 1, \cdots, m$), the semi-linear elliptic system \begin{equation*} \begin{cases} \Delta u_i + \prod_{j = 1}^m u_j^{a_{ij}} = 0 & \text{ in } \mathbb R_+^N,…