Low rank approximate solutions to large Sylvester matrix equations (Q2496373): 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.2005.11.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001876169 / rank | |||
Normal rank | |||
Revision as of 00:48, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Low rank approximate solutions to large Sylvester matrix equations |
scientific article |
Statements
Low rank approximate solutions to large Sylvester matrix equations (English)
0 references
12 July 2006
0 references
An Arnoldi-based method for solving large and sparse Sylvester matrix equations with low rank right hand sides is presented. From the author's summary: We show how to extract low-rank approximations via a matrix Krylov subspace method. We give some theoretical results such an expression of the exact solution and upper bounds for the norm of the error and for the residual. Numerical experiments will also be given to show the effectiveness of the proposed method.
0 references
low-rank approximations
0 references
Arnoldi-based method
0 references
large and sparse Sylvester matrix equations
0 references
numerical experiments
0 references
