Finite iterative algorithms for the generalized Sylvester-conjugate matrix equation \(AX+BY=E\overline{X}F+S\)

DOI10.1007/s00607-010-0100-5zbMath1226.65035OpenAlexW1970341509MaRDI QIDQ610436

Wei-Jun Wu, Yan-Ming Fu, Guang-Ren Duan, Ai-guo Wu

Publication date: 8 December 2010

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-010-0100-5

zbMATH Keywords

numerical examplesorthogonalitygeneralized Sylvester matrix equationgeneralized Sylvester-conjugate matrix equationreal inner productfinite iterative algorithmsKalman-Yakubovich-conjugate matrix equation

Mathematics Subject Classification ID

Related Items (12)

An iterative algorithm for the least Frobenius norm Hermitian and generalized skew Hamiltonian solutions of the generalized coupled Sylvester-conjugate matrix equations ⋮ Minimum-norm Hamiltonian solutions of a class of generalized Sylvester-conjugate matrix equations ⋮ The relaxed gradient-based iterative algorithms for a class of generalized coupled Sylvester-conjugate matrix equations ⋮ On the least squares generalized Hamiltonian solution of generalized coupled Sylvester-conjugate matrix equations ⋮ Gradient-based iterative algorithms for generalized coupled Sylvester-conjugate matrix equations ⋮ The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint ⋮ An iterative algorithm for generalized Hamiltonian solution of a class of generalized coupled Sylvester-conjugate matrix equations ⋮ An iterative algorithm for the least Frobenius norm least squares solution of a class of generalized coupled Sylvester-transpose linear matrix equations ⋮ The scaling conjugate gradient iterative method for two types of linear matrix equations ⋮ The matrix iterative methods for solving a class of generalized coupled Sylvester-conjugate linear matrix equations ⋮ Modified conjugate gradient method for obtaining the minimum-norm solution of the generalized coupled Sylvester-conjugate matrix equations ⋮ Iterative methods to solve the generalized coupled Sylvester-conjugate matrix equations for obtaining the centrally symmetric (centrally antisymmetric) matrix solutions

Cites Work

• Iterative solutions to coupled Sylvester-conjugate matrix equations
• Closed-form solutions to Sylvester-conjugate matrix equations
• Closed-form solutions to the nonhomogeneous Yakubovich-conjugate matrix equation
• On solutions of matrix equations \(V - AVF = BW\) and \(V-A\bar V F= BW\)
• Gradient based iterative algorithm for solving coupled matrix equations
• A canonical form for matrices under consimilarity
• On solutions of the matrix equations \(X\)-\(AXB\)=\(C\) and \(A{\overline{X}}B\)=\(C\)
• An iterative method for the least squares symmetric solution of matrix equation \(AXB = C\)
• Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
• A new solution to the generalized Sylvester matrix equation \(AV-EVF=BW\)
• An iterative method for the least squares symmetric solution of the linear matrix equation \(AXB = C\)
• Eigenstructure assignment in descriptor systems
• A complete analytical solution to the equation<tex>TA - FT = LC</tex>and its applications
• The Matrix Equation $A\bar X - XB = C$ and Its Special Cases
• Output feedback eigenstructure assignment using two Sylvester equations
• Design of Generalized PI Observers for Descriptor Linear Systems
• A Parallel Algorithm for the Sylvester Observer Equation
• On the solution to the Sylvester matrix equation AV+BW=EVF
• Solution to Generalized Sylvester Matrix Equations
• A new block algorithm for full-rank solution of the sylvester-observer equation
• Gradient based iterative algorithms for solving a class of matrix equations
• Kronecker Maps and Sylvester-Polynomial Matrix Equations
• An algebraic relation between consimilarity and similarity of complex matrices and its applications
• Consimilarity of quaternion matrices and complex matrices

This page was built for publication: Finite iterative algorithms for the generalized Sylvester-conjugate matrix equation \(AX+BY=E\overline{X}F+S\)