Numerical solution of Sylvester matrix equations with normal coefficients
- Authors: Ikramov K.D.1, Vorontsov Y.O.2
-
Affiliations:
- Faculty of Computational Mathematics and Cybernetics
- Ltd “GlobeMedia”
- Issue: Vol 41, No 4 (2017)
- Pages: 153-156
- Section: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176199
- DOI: https://doi.org/10.3103/S0278641917040045
- ID: 176199
Cite item
Abstract
Algorithms of the Bartels–Stewart type for the numerical solution of Sylvester matrix equations of modest size are modified for the case where the linear operators associated with these equations are normal. The superiority of the modified algorithms over the original ones is illustrated by numerical results.
About the authors
Kh. D. Ikramov
Faculty of Computational Mathematics and Cybernetics
Author for correspondence.
Email: ikramov@cs.msu.su
Russian Federation, Moscow
Yu. O. Vorontsov
Ltd “GlobeMedia”
Email: ikramov@cs.msu.su
Russian Federation, Moscow
Supplementary files
