About the solvability of matrix polynomial equations
From MaRDI portal
Abstract: We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd degree with non-degenerate leading form can be solved in self-adjoint matrices. We also study equations of even degree and equations in many variables.
Recommendations
- Solvability theory and iteration method for one self-adjoint polynomial matrix equation
- The selfadjoint solutions of matrix quadratic equations
- The semiscalar equivalence of polynomial matrices and the solution of the Sylvester matrix polynomial equations
- On a class of matrix polynomial equations
- Solvability and sensitivity analysis of polynomial matrix equation \(X^s + A^TX^tA = Q\)
Cited in
(8)- Real solutions to two-sided polynomial matrix equations
- Polynomial solutions to the matrix equation \(X-AX^T B=C\)
- An efficient and accurate algorithm for computing the matrix cosine based on new Hermite approximations
- Solvability theory and iteration method for one self-adjoint polynomial matrix equation
- Solutions of the matrix equation \(p(X)=A\), with polynomial function \(p(\lambda)\) over field extensions of \(\mathbb{Q}\)
- Genericness of solution to N-dimensional polynomial matrix equation XA=I
- scientific article; zbMATH DE number 4067106 (Why is no real title available?)
- Finding a complete set of solutions or proving unsolvability for certain classes of matrix polynomial equations with commuting coefficients
This page was built for publication: About the solvability of matrix polynomial equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357100)
