Related papers: How to solve the matrix equation XA-AX=f(X)

In this paper the nonlinear matrix equation X-A^{*}X^{-p}A=Q with p>0 is investigated. We consider two cases of this equation: the case p>1 and the case 0<p<1. In the case p>1, a new sufficient condition for the existence of a unique…

We derive the solvability conditions and a formula of a general solution to a Sylvester-type matrix equation over Hamilton quaternions. As an application, we investigate the necessary and sufficient conditions for the solvability of the…

In this paper, we derive some necessary and sufficient solvability conditions for some systems of one sided coupled Sylvester-type real quaternion matrix equations in terms of ranks and generalized inverses of matrices. We also give the…

The matrix equation $AX-XB=C$ has a solution if and only if the matrices [A&C\\0&B] and [A &0\\0 & B] are similar. This criterion was proved over a field by W.E. Roth (1952) and over the skew field of quaternions by Huang Liping (1996).…

The absolute value equations (AVE) problem is an algebraic problem of solving Ax+|x|=b. So far, most of the research focused on methods for solving AVEs, but we address the problem itself by analysing properties of AVE and the corresponding…

If ${A}$ has no eigenvalues on the closed negative real axis, and $B$ is arbitrary square complex, the matrix-matrix exponentiation is defined as $A^B:=e^{\log({A}){B}}$. This function arises, for instance, in Von Newmann's…

We give a series of very general sufficient conditions in order to ensure the uniqueness of large solutions for --$\Delta$u + f (x, u) = 0 in a bounded domain $\Omega$ where f : $\Omega$ x R $\rightarrow$ R + is a continuous function, such…

Solving of regular equations via Arden's Lemma is folklore knowledge. We first give a concise algorithmic specification of all elementary solving steps. We then discuss a computational interpretation of solving in terms of coercions that…

Sylvester-type matrix equations have applications in areas including control theory, neural networks, and image processing. In this paper, we establish the necessary and sufficient conditions for the system of Sylvester-type quaternion…

We show that the discrete operator stemming from the time and space discretization of evolutionary partial differential equations can be represented in terms of a single Sylvester matrix equation. A novel solution strategy that combines…

This is the first in a series of papers which deal with the development of novel methods for solving a system of linear algebraic equations with a time complexity lower than existing algorithms. The NxN system of linear equations, Ax = b,…

We consider the $\top$-Stein equation $X = AX^\top B + C$, where the operator $(\cdot)^\top$ denotes the transpose ($\top$) of a matrix. In the first part of this paper, we analyze necessary and sufficient conditions for the existence and…

A recurrence relations for sums of powers of complex functions can be written as a system of linear equation AX=B. Using properties of determinant and Cramer's rule for solving systems of linear equation, this paper presents an absolutely…

This paper is concerned with the positive definite solutions to the matrix equation $X+A^{\mathrm{H}}\bar{X}^{-1}A=I$ where $X$ is the unknown and $A$ is a given complex matrix. By introducing and studying a matrix operator on complex…

Let us extend the pair of operations (max,+) over real numbers to matrices in the same way as in conventional linear algebra. We study integer images of max-plus linear mappings. The question whether Ax (in the max-plus algebra) is an…

This work is to provide a comprehensive treatment of the relationship between the theory of the generalized (palindromic) eigenvalue problem and the theory of the Sylvester-type equations. Under a regularity assumption for a specific matrix…

Given two $k\times n$ matrices $A$ and $B$, we describe a couple of methods to solve the matrix equation $XA=BY$, where $X$ is an invertible $k\times k$ matrix, and $Y$ is an $n\times n$ permutation matrix, both of which we want to…

We consider the solution of the Sylvester equation $AX+XB=C$ in mixed precision. We derive a new iterative refinement scheme to solve perturbed quasi-triangular Sylvester equations; our rounding error analysis provides sufficient conditions…

We present a symbolic-numeric method to refine an approximate isolated singular solution $\hat{\mathbf{x}}=(\hat{x}_{1}, ..., \hat{x}_{n})$ of a polynomial system $F=\{f_1, ..., f_n\}$ when the Jacobian matrix of $F$ evaluated at…

Let $X$ be an integral affine or projective scheme of finite presentation over a perfect field. We prove that $X$ admits a resolution, that is, there exists a smooth scheme $\widetilde X$ and a projective birational morphism from…