Log In Sign Up

Improved parallel-in-time integration via low-rank updates and interpolation

by   Daniel Kressner, et al.

This work is concerned with linear matrix equations that arise from the space-time discretization of time-dependent linear partial differential equations (PDEs). Such matrix equations have been considered, for example, in the context of parallel-in-time integration leading to a class of algorithms called ParaDiag. We develop and analyze two novel approaches for the numerical solution of such equations. Our first approach is based on the observation that the modification of these equations performed by ParaDiag in order to solve them in parallel has low rank. Building upon previous work on low-rank updates of matrix equations, this allows us to make use of tensorized Krylov subspace methods to account for the modification. Our second approach is based on interpolating the solution of the matrix equation from the solutions of several modifications. Both approaches avoid the use of iterative refinement needed by ParaDiag and related space-time approaches in order to attain good accuracy. In turn, our new approaches have the potential to outperform, sometimes significantly, existing approaches. This potential is demonstrated for several different types of PDEs.


page 1

page 2

page 3

page 4


Hierarchical adaptive low-rank format with applications to discretized PDEs

A novel compressed matrix format is proposed that combines an adaptive h...

Solving differential Riccati equations: A nonlinear space-time method using tensor trains

Differential algebraic Riccati equations are at the heart of many applic...

Numerical methods for differential linear matrix equations via Krylov subspace methods

In the present paper, we present some numerical methods for computing ap...

Parallel block preconditioners for virtual element discretizations of the time-dependent Maxwell equations

The focus of this study is the construction and numerical validation of ...

Alternating Energy Minimization Methods for Multi-term Matrix Equations

We develop computational methods for approximating the solution of a lin...

Recursive blocked algorithms for linear systems with Kronecker product structure

Recursive blocked algorithms have proven to be highly efficient at the n...

Feature Engineering with Regularity Structures

We investigate the use of models from the theory of regularity structure...