Computing tall skinny solutions of AX−XB=C
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.
Year of publication: |
2003
|
---|---|
Authors: | Brandts, Jan |
Published in: |
Mathematics and Computers in Simulation (MATCOM). - Elsevier, ISSN 0378-4754. - Vol. 61.2003, 3, p. 385-397
|
Publisher: |
Elsevier |
Subject: | Sylvester equation | Subspace methods | Invariant subspaces |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Indication of a stability loss in the continuation of invariant subspaces
Liberda, Ondřej, (2003)
-
Efficient Perturbation Methods for Solving Regime-Switching DSGE Models
Maih, Junior, (2015)
-
Option pricing by the Legendre wavelets method
Doostaki, Reza, (2022)
- More ...