A preconditioned iteration method for solving Sylvester equations (Q1760676)
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 preconditioned iteration method for solving Sylvester equations |
scientific article; zbMATH DE number 6106202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A preconditioned iteration method for solving Sylvester equations |
scientific article; zbMATH DE number 6106202 |
Statements
A preconditioned iteration method for solving Sylvester equations (English)
0 references
15 November 2012
0 references
Summary: A preconditioned gradient-based iterative method is derived by judicious selection of two auxiliary matrices. The strategy is based on the Newton's iteration method and can be regarded as a generalization of the splitting iterative method for system of linear equations. We analyze the convergence of the method and illustrate that the approach is able to considerably accelerate the convergence of the gradient-based iterative method.
0 references
preconditioned gradient-based iterative method
0 references
Newton's iteration method
0 references
splitting iterative method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8424659371376038
0 references
0.8375754952430725
0 references
0.8260296583175659
0 references
0.8190305829048157
0 references
0.8182809352874756
0 references
