### Abstract

In a previous article by Aihua Li and Duane Randall, the existence of solutions to certain matrix equations is demonstrated via nonconstructive methods. A recurring example appears in that work, namely the matrix equation AXA = X^{2}AX, where A is a fixed, square matrix with real entries and X is an unknown square matrix. In this paper, the solution space is explicitly constructed for all 2×2 complex matrices using Gröbner basis techniques. When A is a 2×2 matrix, the equation AXA = X^{2}AX is equivalent to a system of four polynomial equations. The solution space then is the variety defined by the polynomials involved. The ideal of the underlying polynomial ring generated by the defining polynomials plays an important role in solving the system. In our procedure for solving these equations, Gröbner bases are used to transform the polynomial system into a simpler one, which makes it possible to classify all the solutions. In addition to classifying all solutions for 2 × 2 matrices, certain explicit solutions are produced in arbitrary dimensions when A is nonsingular. In higher dimensions, Gröbner bases are extraordinarily computationally demanding, and so a different approach is taken. This technique can be applied to more general matrix equations, and the focus here is placed on solutions coming from a particular class of matrices.

Original language | English |
---|---|

Pages (from-to) | 142-153 |

Number of pages | 12 |

Journal | Electronic Journal of Linear Algebra |

Volume | 21 |

State | Published - 24 Nov 2010 |

### Fingerprint

### Keywords

- Gröbner bases
- Ideal
- Matrix equation

### Cite this

^{2}AX = AXA.

*Electronic Journal of Linear Algebra*,

*21*, 142-153.

}

^{2}AX = AXA',

*Electronic Journal of Linear Algebra*, vol. 21, pp. 142-153.

**On the construction of explicit solutions to the matrix equation X ^{2}AX = AXA.** / Li, Aihua; Mosteig, Edward.

Research output: Contribution to journal › Article

TY - JOUR

T1 - On the construction of explicit solutions to the matrix equation X2AX = AXA

AU - Li, Aihua

AU - Mosteig, Edward

PY - 2010/11/24

Y1 - 2010/11/24

N2 - In a previous article by Aihua Li and Duane Randall, the existence of solutions to certain matrix equations is demonstrated via nonconstructive methods. A recurring example appears in that work, namely the matrix equation AXA = X2AX, where A is a fixed, square matrix with real entries and X is an unknown square matrix. In this paper, the solution space is explicitly constructed for all 2×2 complex matrices using Gröbner basis techniques. When A is a 2×2 matrix, the equation AXA = X2AX is equivalent to a system of four polynomial equations. The solution space then is the variety defined by the polynomials involved. The ideal of the underlying polynomial ring generated by the defining polynomials plays an important role in solving the system. In our procedure for solving these equations, Gröbner bases are used to transform the polynomial system into a simpler one, which makes it possible to classify all the solutions. In addition to classifying all solutions for 2 × 2 matrices, certain explicit solutions are produced in arbitrary dimensions when A is nonsingular. In higher dimensions, Gröbner bases are extraordinarily computationally demanding, and so a different approach is taken. This technique can be applied to more general matrix equations, and the focus here is placed on solutions coming from a particular class of matrices.

AB - In a previous article by Aihua Li and Duane Randall, the existence of solutions to certain matrix equations is demonstrated via nonconstructive methods. A recurring example appears in that work, namely the matrix equation AXA = X2AX, where A is a fixed, square matrix with real entries and X is an unknown square matrix. In this paper, the solution space is explicitly constructed for all 2×2 complex matrices using Gröbner basis techniques. When A is a 2×2 matrix, the equation AXA = X2AX is equivalent to a system of four polynomial equations. The solution space then is the variety defined by the polynomials involved. The ideal of the underlying polynomial ring generated by the defining polynomials plays an important role in solving the system. In our procedure for solving these equations, Gröbner bases are used to transform the polynomial system into a simpler one, which makes it possible to classify all the solutions. In addition to classifying all solutions for 2 × 2 matrices, certain explicit solutions are produced in arbitrary dimensions when A is nonsingular. In higher dimensions, Gröbner bases are extraordinarily computationally demanding, and so a different approach is taken. This technique can be applied to more general matrix equations, and the focus here is placed on solutions coming from a particular class of matrices.

KW - Gröbner bases

KW - Ideal

KW - Matrix equation

UR - http://www.scopus.com/inward/record.url?scp=78449272492&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:78449272492

VL - 21

SP - 142

EP - 153

JO - Electronic Journal of Linear Algebra

JF - Electronic Journal of Linear Algebra

SN - 1081-3810

ER -

^{2}AX = AXA. Electronic Journal of Linear Algebra. 2010 Nov 24;21:142-153.