Fast verified computation for the solution of the T-congruence Sylvester equation

DOI10.1007/s13160-018-0307-yzbMath1434.65047OpenAlexW2801423590MaRDI QIDQ1756718

Shinya Miyajima

Publication date: 21 December 2018

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-018-0307-y

zbMATH Keywords

discrete Lyapunov equationverified numerical computationT-congruence Sylvester equation

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Algorithms with automatic result verification (65G20) Numerical methods for matrix equations (65F45)

Related Items

Lopsided DSS iteration method for solving complex Sylvester matrix equation, Relation between the T-congruence Sylvester equation and the generalized Sylvester equation

Uses Software

• INTLAB
• VERSOFT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Kronecker products and their applications
• Fast enclosure for solutions of Sylvester equations
• Fast enclosure for solutions of generalized Sylvester equations
• Verified error bounds for solutions of Sylvester matrix equations
• Numerical enclosure for each eigenvalue in generalized eigenvalue problem
• Implicit QR algorithms for palindromic and even eigenvalue problems
• On a relationship between the \(\operatorname{T}\)-congruence Sylvester equation and the Lyapunov equation
• The solution of the equation \(AX + X^{\star}B =0\)
• Fast Enclosure for All Eigenvalues and Invariant Subspaces in Generalized Eigenvalue Problems
• An Algorithm for Computing Reducing Subspaces by Block Diagonalization
• Structured Condition Numbers for Invariant Subspaces
• Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations