Brandts, Jan - In: Mathematics and Computers in Simulation (MATCOM) 61 (2003) 3, pp. 385-397
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...