Related papers: A posteriori error analysis for a space-time paral…
A class of linear parabolic equations are considered. We derive a common framework for the a posteriori error analysis of certain second-order time discretisations combined with finite element discretisations in space. In particular we…
In this article, we present a parallel recursive algorithm based on multi-level domain decomposition that can be used as a precondtioner to a Krylov subspace method to solve sparse linear systems of equations arising from the discretization…
An integro-differential equation of hyperbolic type, with mixed boundary conditions, is considered. A continuous space-time finite element method of degree one is formulated. A posteriori error representations based on space-time cells is…
We develop a novel a posteriori error estimator for the $L^2$ error committed by the finite element discretization of the solution of the fractional Laplacian. Our a posteriori error estimator takes advantage of the semi-discretization…
We compare the long-time error bounds and spatial resolution of finite difference methods with different spatial discretizations for the Dirac equation with small electromagnetic potentials characterized by $\varepsilon \in (0, 1]$ a…
Parallel-in-time algorithms have been successfully employed for reducing time-to-solution of a variety of partial differential equations, especially for diffusive (parabolic-type) equations. A major failing of parallel-in-time approaches to…
We introduce Prob-GParareal, a probabilistic extension of the GParareal algorithm designed to provide uncertainty quantification for the Parallel-in-Time (PinT) solution of (ordinary and partial) differential equations (ODEs, PDEs). The…
In the theory and practice of inverse problems for partial differential equations (PDEs) much attention is paid to the problem of the identification of coefficients from some additional information. This work deals with the problem of…
We introduce an unfitted finite element method with Lagrange-multipliers to study an Eulerian time stepping scheme for moving domain problems applied to a model problem where the domain motion is implicit to the problem. We consider a…
Stochastic parareal (SParareal) is a probabilistic variant of the popular parallel-in-time algorithm known as parareal. Similarly to parareal, it combines fine- and coarse-grained solutions to an ordinary differential equation (ODE) using a…
We introduce a micro-macro parareal algorithm for the time-parallel integration of multiscale-in-time systems. The algorithm first computes a cheap, but inaccurate, solution using a coarse propagator (simulating an approximate slow…
Asynchronous iterations are more and more investigated for both scaling and fault-resilience purpose on high performance computing platforms. While so far, they have been exclusively applied within space domain decomposition frameworks,…
Time-parallel algorithms, such as Parareal, are well-understood for linear problems, but their convergence analysis for nonlinear, chaotic systems remains limited. This paper introduces a new theoretical framework for analysing…
We present convergence results in expectation for stochastic subspace correction schemes and their accelerated versions to solve symmetric positive-definite variational problems, and discuss their potential for achieving fault tolerance in…
This paper presents a highly-parallelizable parallel-in-time algorithm for efficient solution of nonlinear time-periodic problems. It is based on the time-periodic extension of the Parareal method, known to accelerate sequential…
This paper presents and analyzes a parallelizable iterative procedure based on domain decomposition for primal-dual weak Galerkin (PDWG) finite element methods applied to the Poisson equation. The existence and uniqueness of the PDWG…
We consider the discretization of a class of nonlinear parabolic equations by discontinuous Galerkin time-stepping methods and establish a priori as well as conditional a posteriori error estimates. Our approach is motivated by the error…
Compactly expressing large-scale datasets through Multivariate Functional Approximations (MFA) can be critically important for analysis and visualization to drive scientific discovery. Tackling such problems requires scalable data…
We present and analyze an a posteriori error estimator based on mesh refinement for the solution of the hypersingular boundary integral equation governing the Laplacian in three dimensions. The discretization under consideration is a…
A class of linear parabolic equations is considered. We derive a framework for the a posteriori error analysis of time discretisations by Richardson extrapolation of arbitrary order combined with finite element discretisations in space. We…