A numerical algorithm for solving the matrix equation AX + X T B = C 1
From MaRDI portal
Publication:2898109
DOI10.1134/S0965542511050058zbMath1249.65099OpenAlexW2093478721MaRDI QIDQ2898109
Yu. O. Vorontsov, Khakim D. Ikramov
Publication date: 16 July 2012
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542511050058
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Backward errors and small-sample condition estimation for ⋆-Sylveter equations ⋮ Computational Methods for Linear Matrix Equations ⋮ Numerical solution of the matrix equations \(AX+X^TB=C\) and \(X+AX^TB=C\) with rectangular coefficients \(A\) and \(B\) ⋮ Numerical algorithm for solving the matrix equation \(AX+X^\ast B=C\) ⋮ Numerical solution of the matrix equations AX + X T B = C and AX + X*B = C in the self-adjoint case ⋮ Numerical algorithms for solving matrix equations AX + BX T = C and AX + BX* = C ⋮ The matrix equation \(X + AX^TB = C\): Conditions for unique solvability and a numerical algorithm for its solution ⋮ Projection methods for large-scale T-Sylvester equations
This page was built for publication: A numerical algorithm for solving the matrix equation AX + X T B = C 1
