A new version of successive approximations method for solving Sylvester matrix equations (Q876643)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new version of successive approximations method for solving Sylvester matrix equations |
scientific article; zbMATH DE number 5147041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new version of successive approximations method for solving Sylvester matrix equations |
scientific article; zbMATH DE number 5147041 |
Statements
A new version of successive approximations method for solving Sylvester matrix equations (English)
0 references
26 April 2007
0 references
The authors present a new version of the successive approximations algorithm for solving the Sylvester equation \(AX-XB=C\). The new method uses in each iteration the block GMRES-Sylvester algorithm for solving the new Sylvester equation with the new coefficient matrices. The convergence of the algorithm is proved for the case when \(A\) and \(B\) are symmetric negative and positive definite matrices, respectively.
0 references
Sylvester matrix equations
0 references
field of values
0 references
block GMRES-Sylvester method
0 references
successive approximations method
0 references
convergence
0 references
0 references
0 references
0 references
0.8435046672821045
0 references
0.8170585036277771
0 references
0.8135979175567627
0 references
0.8131303191184998
0 references
0.811141848564148
0 references
