A new version of successive approximations method for solving Sylvester matrix equations (Q876643): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.08.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003424164 / rank | |||
Normal rank | |||
Revision as of 01:30, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new version of successive approximations method for solving Sylvester matrix equations |
scientific article |
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
