On the Sylvester-like matrix equation AX+f(X)B=C
From MaRDI portal
Abstract: Many applications in applied mathematics and control theory give rise to the unique solution of a Sylvester-like matrix equation associated with an underlying structured matrix operator . In this paper, we will discuss the solvability of the Sylvester-like matrix equation through an auxiliary standard (or generalized) Sylvester matrix equation. We also show that when this Sylvester-like matrix equation is uniquely solvable, the closed-form solutions can be found by using previous result. In addition, with the aid of the Kronecker product some useful results of the solvability of this matrix equation are provided.
Recommendations
- A general analysis of Sylvester's matrix equation
- Sufficient conditions for the solvability of a Sylvester-like absolute value matrix equation
- Solving the generalized Sylvester matrix equation AV+BW=EVF via a Kronecker map
- New sufficient conditions for the unique solution of a square Sylvester-like absolute value equation
- Toward solution of matrix equation \(X=Af(X)B+C\)
Cites work
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 3435336 (Why is no real title available?)
- scientific article; zbMATH DE number 802915 (Why is no real title available?)
- A canonical form for matrices under consimilarity
- Computational Methods for Linear Matrix Equations
- Conjugate-normal matrices: A survey
- Explicit solution of the matrix equation AXB-CXD=E
- Maps on matrix spaces
- Numerical solution of algebraic Riccati equations.
- On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
- On the solution of the linear matrix equation X = Af(X) B + C
- Palindromic eigenvalue problems: A brief survey
- Parametric solutions to the generalized discrete Sylvester matrix equation MXN - X = TY and their applications
- Resolvent expansions of matrices and applications
- Solution of the Equation $AX + XB = C$ by Inversion of an $M \times M$ or $N \times N$ Matrix
- Solutions to a family of matrix equations by using the Kronecker matrix polynomials
- Structured Condition Numbers for Invariant Subspaces
- The Laurent expansion for a nearly singular matrix
- The Laurent expansion of pencils that are singular at the origin
- The Matrix Equation $A\bar X - XB = C$ and Its Special Cases
- The autonomous linear quadratic control problem. Theory and numerical solution
- The commutation matrix: Some properties and applications
- The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\)
- Toward solution of matrix equation \(X=Af(X)B+C\)
- Towards positive definite solutions of a class of nonlinear matrix equations
Cited in
(13)- Preconditioned HSS iteration method and its non-alternating variant for continuous Sylvester equations
- Solution of the Sylvester matrix equation AXB T + CXD T = E
- A numerical approach to generalized periodic Sylvester matrix equation
- On the semigroup property for some structured iterations
- On the solution to the Sylvester matrix equation AV+BW=EVF
- An accelerated technique for solving the positive definite solutions of a class of nonlinear matrix equations
- Consistency of split quaternion matrix equations \(AX^{\star }-XB=CY+D\) and \(X-AX^\star B=CY+D\)
- Convergence of HS version of BCR algorithm to solve the generalized Sylvester matrix equation over generalized reflexive matrices
- Solutions to linear bimatrix equations with applications to pole assignment of complex-valued linear systems
- An iterative method based on ADMM for solving generalized Sylvester matrix equations
- Generalized reflexive and anti-reflexive solutions of the coupled Sylvester matrix equations via CD algorithm
- Developing Kaczmarz method for solving Sylvester matrix equations
- An iterative algorithm for periodic Sylvester matrix equations
This page was built for publication: On the Sylvester-like matrix equation \(AX+f(X)B=C\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285672)
