Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (Extended abstract)

© 2018, Springer International Publishing AG, part of Springer Nature. We establish upper bounds of bit complexity of computing solution operators for symmetric hyperbolic systems of PDEs. Here we continue the research started in our papers of 2009 and 2017, where computability, in the rigorous sense of computable analysis, has been established for solution operators of Cauchy and dissipative boundary-value problems for such systems

Applications and accuracy of the parallel diagonal dominant algorithm

The Parallel Diagonal Dominant (PDD) algorithm is a highly efficient, ideally scalable tridiagonal solver. In this paper, a detailed study of the PDD algorithm is given. First the PDD algorithm is introduced. Then the algorithm is extended to solve periodic tridiagonal systems. A variant, the reduced PDD algorithm, is also proposed. Accuracy analysis is provided for a class of tridiagonal systems, the symmetric, and anti-symmetric Toeplitz tridiagonal systems. Implementation results show that the analysis gives a good bound on the relative error, and the algorithm is a good candidate for the emerging massively parallel machines

Computability of differential equations

In this chapter, we provide a survey of results concerning the computability and computational complexity of differential equations. In particular, we study the conditions which ensure computability of the solution to an initial value problem for an ordinary differential equation (ODE) and analyze the computational complexity of a computable solution. We also present computability results concerning the asymptotic behaviors of ODEs as well as several classically important partial differential equations.info:eu-repo/semantics/acceptedVersio

Review of Summation-by-parts schemes for initial-boundary-value problems

High-order finite difference methods are efficient, easy to program, scales well in multiple dimensions and can be modified locally for various reasons (such as shock treatment for example). The main drawback have been the complicated and sometimes even mysterious stability treatment at boundaries and interfaces required for a stable scheme. The research on summation-by-parts operators and weak boundary conditions during the last 20 years have removed this drawback and now reached a mature state. It is now possible to construct stable and high order accurate multi-block finite difference schemes in a systematic building-block-like manner. In this paper we will review this development, point out the main contributions and speculate about the next lines of research in this area

Fourth-order time-stepping for stiff PDEs on the sphere

We present in this paper algorithms for solving stiff PDEs on the unit sphere with spectral accuracy in space and fourth-order accuracy in time. These are based on a variant of the double Fourier sphere method in coefficient space with multiplication matrices that differ from the usual ones, and implicit-explicit time-stepping schemes. Operating in coefficient space with these new matrices allows one to use a sparse direct solver, avoids the coordinate singularity and maintains smoothness at the poles, while implicit-explicit schemes circumvent severe restrictions on the time-steps due to stiffness. A comparison is made against exponential integrators and it is found that implicit-explicit schemes perform best. Implementations in MATLAB and Chebfun make it possible to compute the solution of many PDEs to high accuracy in a very convenient fashion

Mini-Workshop: Adaptive Methods for Control Problems Constrained by Time-Dependent PDEs

Optimization problems constrained by time-dependent PDEs (Partial Differential Equations) are challenging from a computational point of view: even in the simplest case, one needs to solve a system of PDEs coupled globally in time and space for the unknown solutions (the state, the costate and the control of the system). Typical and practically relevant examples are the control of nonlinear heat equations as they appear in laser hardening or the thermic control of flow problems (Boussinesq equations). Specifically for PDEs with a long time horizon, conventional time-stepping methods require an enormous storage of the respective other variables. In contrast, adaptive methods aim at distributing the available degrees of freedom in an a-posteriori-fashion to capture singularities and are, therefore, most promising