Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0378-4754(02)00091-5 | Mathematics and Computers in Simulation |
Keywords | DocType | Volume |
Sylvester equation,Subspace methods,Invariant subspaces | Journal | 61 |
Issue | ISSN | Citations |
3 | 0378-4754 | 1 |
PageRank | References | Authors |
0.36 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan Brandts | 1 | 54 | 5.96 |