An finite iterative algorithm for sloving periodic Sylvester bimatrix equations

The problem considered in this paper is to solve periodic Sylvester bimatrix equations. Based on the conjugate gradient method and least squares principle, an iterative algorithm is presented to solve the periodic Sylvester bimatrix equations. We show that the iterative solutions of the algorithm co...

Full description

Saved in:
Bibliographic Details
Published inJournal of the Franklin Institute Vol. 357; no. 15; pp. 10757 - 10772
Main Authors Zhang, Lei, Tang, Shiyu, Lv, Lingling
Format Journal Article
LanguageEnglish
Published Elmsford Elsevier Ltd 01.10.2020
Elsevier Science Ltd
Subjects
Algorithms
Conjugate gradient method
Exact solutions
Finite element analysis
Iterative algorithms
Iterative methods
Nonlinear equations
Numerical analysis
Studies
Online AccessGet full text

Cover

More Information
Summary:The problem considered in this paper is to solve periodic Sylvester bimatrix equations. Based on the conjugate gradient method and least squares principle, an iterative algorithm is presented to solve the periodic Sylvester bimatrix equations. We show that the iterative solutions of the algorithm converge to the exact solutions at finite steps with any initial values. Finally, a numerical example is given to illustrate the validity and efficiency of the iterative algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0016-0032
1879-2693
0016-0032
DOI:10.1016/j.jfranklin.2020.07.042