On the -Sylvester equation AX X^ B^ = C

DOI10.1016/J.AMC.2012.01.065zbMATH Open1245.15018OpenAlexW2068782821MaRDI QIDQ440722FDOQ440722

Authors: Chun-Yueh Chiang, Eric King-wah Chu, Wen-Wei Lin 

Publication date: 19 August 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.01.065

Recommendations

• scientific article; zbMATH DE number 6098827
• On a transformation of the \(\ast\)-congruence Sylvester equation for the least squares optimization
• Backward errors and small-sample condition estimation for ⋆-Sylveter equations
• A note on Sylvester-type equations
• On the condition mumbers for \(*\)-Sylvester matrix equation

zbMATH Keywords

singular value decompositionLyapunov equationsolvabilitylinear matrix equationQR decompositiongeneralized algebraic Riccati equationSchur decompositionpalindromic eigenvalue problem

Mathematics Subject Classification ID

Matrix equations and identities (15A24)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Accuracy and Stability of Numerical Algorithms
• Gradient based and least squares based iterative algorithms for matrix equations \(AXB + CX^{T}D = F\)
• Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\)
• The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\)
• Title not available (Why is that?)
• Structured Condition Numbers for Invariant Subspaces
• The Equations A^TX\pm X^TA=B
• Iterative algorithms for the minimum-norm solution and the least-squares solution of the linear matrix equations \(A_1XB_1 + C_1X^TD_1 = M_1, A_2XB_2 + C_2 X^TD_2 = M_2\)
• The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
• The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
• Vibration of fast trains, palindromic eigenvalue problems and structure-preserving doubling algorithms
• Iterative methods for solving linear matrix equation and linear matrix system
• A note on the matrix equation \(H=AP+PA**\)
• Backward error, sensitivity, and refinement of computed solutions of algebraic Riccati equations
• On the matrix function \(AX + X'A'\)

Cited In (22)

• An extended Hamiltonian algorithm for the general linear matrix equation
• Solvability and uniqueness criteria for generalized Sylvester-type equations
• On the solution of the linear matrix equation \(X = Af(X) B + C\)
• On the Sylvester-like matrix equation \(AX+f(X)B=C\)
• On T-Sylvester equations over commutative rings
• The solutions of the quaternion matrix equation \(AX^\varepsilon + BX^\delta = 0\)
• Global FOM and GMRES algorithms for a class of complex matrix equations
• On a transformation of the \(\ast\)-congruence Sylvester equation for the least squares optimization
• Projection methods for large-scale T-Sylvester equations
• On the solvability of generalized Sylvester operator equations
• A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations
• The solutions of a class of Sylvester-like linear matrix equations and the estimation of the associated measurements of their solutions
• Some iterative algorithms for positive definite solution to nonlinear matrix equations
• Q-less QR decomposition in inner product spaces
• A note on Sylvester-type equations
• Uniqueness of solution of a generalized \(\star\)-Sylvester matrix equation
• Positive definite solutions of the nonlinear matrix equation \(X + A^H\bar{X}^{-1}A = I\)
• On estimating the separation between \((A, B)\) and \((C, D)\) associated with the generalized Sylvester equation \(A X D - B X C = E\)
• A note on the \(\top\)-Stein matrix equation
• Relation between the T-congruence Sylvester equation and the generalized Sylvester equation
• The solution of the equation \(AX+BX^{\star}=0\)
• Backward errors and small-sample condition estimation for ⋆-Sylveter equations

Uses Software

• Matlab
• mctoolbox

This page was built for publication: On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q440722)