Abstract: 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 pencil, we show that the solution of the -Sylvester matrix equation is uniquely determined and can be obtained by considering its corresponding deflating subspace. We also propose an iterative method with quadratic convergence to compute the stabilizing solution of the -Sylvester matrix equation via the well-developed palindromic doubling algorithm. We believe that our discussion is the first which implements the tactic of the deflating subspace for solving Sylvester equations and could give rise to the possibility of developing an advanced and effective solver for different types of matrix equations.
Recommendations
- scientific article; zbMATH DE number 6098827
- On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
- Sylvester's equation: Accuracy and computational stability
- Solutions to generalized Sylvester matrix equation by Schur decomposition
- Solvability and uniqueness criteria for generalized Sylvester-type equations
Cites work
- scientific article; zbMATH DE number 1001726 (Why is no real title available?)
- scientific article; zbMATH DE number 6098827 (Why is no real title available?)
- scientific article; zbMATH DE number 3756646 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 802915 (Why is no real title available?)
- A structure-preserving doubling algorithm for nonsymmetric algebraic Riccati equation
- Implicit QR algorithms for palindromic and even eigenvalue problems
- Iterative methods for solving linear matrix equation and linear matrix system
- Matrix iterative methods for solving the Sylvester-transpose and periodic Sylvester matrix equations
- Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
- On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
- Palindromic eigenvalue problems: A brief survey
- Roth's theorems for matrix equations with symmetry constraints
- Structured Condition Numbers for Invariant Subspaces
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- The autonomous linear quadratic control problem. Theory and numerical solution
- The palindromic generalized eigenvalue problem \(A^{*}x=\lambda Ax\): Numerical solution and applications
- The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\)
- The solution to matrix equation \(AX+X^TC=B\)
- Vector Spaces of Linearizations for Matrix Polynomials
- Vibration of fast trains, palindromic eigenvalue problems and structure-preserving doubling algorithms
Cited in
(6)- On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
- Solvability and uniqueness criteria for generalized Sylvester-type equations
- On the semigroup property for some structured iterations
- An iterative method for solving the stable subspace of a matrix pencil and its application
- A new version of the Smith method for solving Sylvester equation and discrete-time Sylvester equation
- scientific article; zbMATH DE number 6472488 (Why is no real title available?)
This page was built for publication: A note on Sylvester-type equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1660464)
