Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Recent results on the convergence of a Galerkin projection method for the Sylvester equation are extended to more general linear systems with tensor product structure. In the Hermitian positive definite case, explicit convergence bounds are derived for Galerkin projection based on tensor products of rational Krylov subspaces. The results can be used to optimize the choice of shifts for these methods. Numerical experiments demonstrate that the convergence rates predicted by our bounds appear to be sharp.
Bernard Kapidani, Rafael Vazquez Hernandez