Computing tall skinny solutions of AX−XB=C

Jan Brandts

Mathematics and Computers in Simulation (MATCOM), 2003, vol. 61, issue 3, 385-397

Abstract: We will concentrate on the numerical computation of so-called tall and skinny solutions X of the Sylvester equations AX−XB=C. By this we mean that A is an n×n matrix with cheaply applicable action (A is for example sparse), and B a k×k matrix, with k≪n. This type of Sylvester equation plays an important role in the computation of invariant subspaces when block Rayleigh quotient or block Jacobi–Davidson methods are used.

Keywords: Sylvester equation; Subspace methods; Invariant subspaces (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475402000915
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:61:y:2003:i:3:p:385-397

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().