A new projection method for solving large Sylvester equations (Q881475): 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.apnum.2006.07.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973485705 / rank | |||
Normal rank | |||
Revision as of 23:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new projection method for solving large Sylvester equations |
scientific article |
Statements
A new projection method for solving large Sylvester equations (English)
0 references
30 May 2007
0 references
The Sylvester equation \(AX+XB+CD^T=0\) and equivalent ones are reformulated as linear equations by arranging the entries of the matrix \(X\) in a vector of appropriate length. The Arnoldi iteration is applied to the linear system and the iterates are used as basis vectors for the approximate solution by low-dimensional Sylvester equations.
0 references
Sylvester matrix equation
0 references
Arnoldi iteration
0 references
matrix Krylov subspace method
0 references
