A note on Sylvester-type equations

DOI10.1016/J.JFRANKLIN.2015.03.012zbMATH Open1395.93242arXiv1311.2130OpenAlexW2090500019MaRDI QIDQ1660464FDOQ1660464

Authors: Matthew M. Lin, Chun-Yueh Chiang 

Publication date: 16 August 2018

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

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 $star$-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 $star$-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.

Full work available at URL: https://arxiv.org/abs/1311.2130

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

zbMATH Keywords

eigenvalue probleminvariant subspace methodSylvester-type equationsdeflating subspace method

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Eigenvalue problems (93B60) Matrix equations and identities (15A24)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A structure-preserving doubling algorithm for nonsymmetric algebraic Riccati equation
• Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
• Implicit QR algorithms for palindromic and even eigenvalue problems
• The autonomous linear quadratic control problem. Theory and numerical solution
• Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
• On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
• The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\)
• Roth's theorems for matrix equations with symmetry constraints
• The solution to matrix equation \(AX+X^TC=B\)
• Title not available (Why is that?)
• Structured Condition Numbers for Invariant Subspaces
• Title not available (Why is that?)
• Matrix iterative methods for solving the Sylvester-transpose and periodic Sylvester matrix equations
• Vector Spaces of Linearizations for Matrix Polynomials
• Palindromic eigenvalue problems: A brief survey
• Vibration of fast trains, palindromic eigenvalue problems and structure-preserving doubling algorithms
• Iterative methods for solving linear matrix equation and linear matrix system
• The palindromic generalized eigenvalue problem \(A^{*}x=\lambda Ax\): Numerical solution and applications

Cited In (6)

• Solvability and uniqueness criteria for generalized Sylvester-type equations
• On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
• 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
• Title not available (Why is that?)

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)