相关论文: Solution of Linear Systems of Equations Ax=b and A…
This contribution describes relationship between fractions, projective representation, duality, linear algebra and geometry. Many problems lead to a system of linear equations. This paper presents equivalence of the Cross-product operation…
This paper presents a finite step method for computing the binary solution to an overdetermined system of linear algebraic equations Ax = b, where A is an m x n real matrix of rank n < m, and b is a real m-vector. The method uses the…
A new algorithm is presented for computing a direct solution to a system of consistent linear equations. It produces a minimum norm particular solution, a generalized inverse (of type {124}), and a null space projection operator. In…
We consider the iterative solution of large linear systems of equations in which the coefficient matrix is the sum of two terms, a sparse matrix $A$ and a possibly dense, rank deficient matrix of the form $\gamma UU^T$, where $\gamma > 0$…
Given a full column rank matrix $A \in \mathbb{R}^{m\times n}$ ($m\geq n$), we consider a special class of linear systems of the form $A^\top Ax=A^\top b+c$ with $x, c \in \mathbb{R}^{n}$ and $b \in \mathbb{R}^{m}$. The occurrence of $c$ in…
In this article, a system of Yang-Baxter-type matrix equations is studied, $XAX=BXB$, $XBX=AXA$, which "generalizes" the matrix Yang-Baxter equation and exhibits a broken symmetry. We investigate the solutions of this system from various…
In this paper we examine the model matching problem that concerns nonlinear input - output discrete systems, containing products among delays of input and output signals, through a special factorization. The algebraic framework of $\de…
Several recent works have developed a new, probabilistic interpretation for numerical algorithms solving linear systems in which the solution is inferred in a Bayesian framework, either directly or by inferring the unknown action of the…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
A system of linear equations is normally understood as a linear mapping between two vector spaces. However, most direct solutions (e.g., QR, LU, ...) rely on the inelegant approach of back-substitution: a significant departure from such a…
In this paper, several row and column orthogonal projection methods are proposed for solving matrix equation $AXB=C$, where the matrix $A$ and $B$ are full rank or rank deficient and equation is consistent or not. These methods are…
We use a recently proposed scheme of matrix extension of dispersionless integrable systems for the Abelian case, in which it leads to linear equations, connected with the initial dispersionless system. In the examples considered, these…
In a recent paper, a distributed algorithm was proposed for solving linear algebraic equations of the form $Ax = b$ assuming that the equation has at least one solution. The equation is presumed to be solved by $m$ agents assuming that each…
The solution of systems of non-autonomous linear ordinary differential equations is crucial in a variety of applications, such us nuclear magnetic resonance spectroscopy. A new method with spectral accuracy has been recently introduced in…
The paper deals with the following system of nonlinear difference equations \begin{equation*} x_{n+1}=ax_{n}^{2}y_{n}+bx_{n}y_{n}^{2},\ y_{n+1}=cx_{n}^{2}y_{n}+dx_{n}y_{n}^{2},\ n\in \mathbb{N}_{0}, \end{equation*} where the initial values…
Direct solution of simultaneous linear equations is regarded to be slow for large systems of equations and requires special treatment to avoid numerical instability. A new method is proposed that addresses the numerical instability without…
I considered solving of the system of linear equations $$a^1_{1s0}x^1a^1_{1s1}+...+a^1_{ns0}x^na^1_{ns1}=b^1$$ $$...$$ $$a^n_{1s0}x^1a^n_{1s1}+...+a^n_{ns0}x^na^n_{ns1}=b^n$$ over non-commutative associative algebra. I considered examples…
A distributed algorithm is described for solving a linear algebraic equation of the form $Ax=b$ assuming the equation has at least one solution. The equation is simultaneously solved by $m$ agents assuming each agent knows only a subset of…
We present new iterative algorithms for solving a square linear system $Ax=b$ in dimension $n$ by employing the {\it Triangle Algorithm} \cite{kal12}, a fully polynomial-time approximation scheme for testing if the convex hull of a finite…
Linear systems often involve, as a basic building block, solutions of equations of the form \begin{align*} A_Sx_S&+A_Px_P =0\\ A'_Sx_S & =0, \end{align*} where our primary interest might be in the vector variable $x_P.$ Usually, neither…