Fast low-rank solution of the Poisson equation with application to the Stokes problem

arXiv1306.2150MaRDI QIDQ6242555FDOQ6242555

Ekaterina Muravleva, Ivan Oseledets

Publication date: 10 June 2013

Abstract: We consider the problem of computing approximate solution of Poisson equation in the low-parametric tensor formats. We propose a new algorithm to compute the solution based on the cross approximation algorithm in the frequency space, and it has better complexity with respect to ranks in comparison with standard algorithms, which are based on the exponential sums approximation. To illustrate the effectiveness of our solver, we incorporate into a Uzawa solver for the Stokes problem on semi-staggered grid as a subsolver. The resulting solver outperforms the standard method for $ngeq256$.

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Preconditioners for iterative methods (65F08)

This page was built for publication: Fast low-rank solution of the Poisson equation with application to the Stokes problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6242555)