We study the enclosing problem for discrete and continuous dynamical systems in the context of computer assisted proofs. We review and compare the existing methods and emphasize the importance of developing a suitable set arithmetic for efficient algorithms solving the enclosing problem.
The parareal in time algorithm allows for efficient parallel numerical simulations of time-dependent problems. It is based on a decomposition of the time interval into subintervals, and on a predictor-corrector strategy, where the propagations over each subinterval for the corrector stage are concurrently performed on the different processors that are available. In this article, we are concerned with the long time integration of Hamiltonian systems. Geometric, structure-preserving integrators are...
The Discontinuous Galerkin Time Domain (DGTD) methods are now popular for the solution of wave propagation problems. Able to deal with unstructured, possibly locally-refined meshes, they handle easily complex geometries and remain fully explicit with easy parallelization and extension to high orders of accuracy. Non-dissipative versions exist, where some discrete electromagnetic energy is exactly conserved. However, the stability limit of the methods, related to the smallest elements in the mesh,...
The Discontinuous Galerkin Time Domain (DGTD) methods are now popular for the solution of wave propagation problems. Able to deal with unstructured, possibly locally-refined meshes, they handle easily complex geometries and remain fully explicit with easy parallelization and extension to high orders of accuracy. Non-dissipative versions exist, where some discrete electromagnetic energy is exactly conserved. However, the stability limit of the methods, related to the smallest elements in the mesh,...