The Alternating Direction Methods for Solving the Sylvester-Type Matrix Equation<br> <em>AXb + CX^⊤D = E^*</em>

DOI10.4208/jcm.1608-m2015-0430zbMath1413.65140OpenAlexW2734489809MaRDI QIDQ4688151

Yi-Fen Ke, Chang-Feng Ma

Publication date: 22 October 2018

Published in: Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/jcm.1608-m2015-0430

zbMATH Keywords

alternating direction methodleast squares solutionbest approximate solutionSylvester-type matrix equation

Mathematics Subject Classification ID

Related Items (6)

On the solutions of a class of tensor equations ⋮ Extending BiCG and BiCR methods to solve the Stein tensor equation ⋮ Iterative algorithms for discrete-time periodic Sylvester matrix equations and its application in antilinear periodic system ⋮ An iterative algorithm for generalized periodic multiple coupled Sylvester matrix equations ⋮ Least squares solution of the quaternion Sylvester tensor equation ⋮ On a transformation of the ∗-congruence Sylvester equation for the least squares optimization

This page was built for publication: The Alternating Direction Methods for Solving the Sylvester-Type Matrix Equation<br> <em>AXb + CX^⊤D = E^*</em>