Related papers: A Parallelizable Implicit Evolution Scheme for Reg…
The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We…
The paper develops high order accurate Runge-Kutta discontinuous local evolution Galerkin (RKDLEG) methods on the cubed-sphere grid for the shallow water equations (SWEs). Instead of using the dimensional splitting method or solving…
We present a modification to the Berger and Oliger adaptive mesh refinement algorithm designed to solve systems of coupled, non-linear, hyperbolic and elliptic partial differential equations. Such systems typically arise during constrained…
We study evolution algebras of arbitrary dimension. We analyze in deep the notions of evolution subalgebras, ideals and non-degeneracy and describe the ideals generated by one element and characterize the simple evolution algebras. We also…
There has been an arising trend of adopting deep learning methods to study partial differential equations (PDEs). In this paper, we introduce a deep recurrent framework for solving time-dependent PDEs without generating large scale data…
This paper focuses on the numerical approximation of the linearized shallow water equations using hybridizable discontinuous Galerkin (HDG) methods, leveraging the Hamiltonian structure of the evolution system. First, we propose an…
A Lagrangian numerical scheme for solving nonlinear degenerate Fokker-Planck equations in space dimensions $d\ge2$ is presented. It applies to a large class of nonlinear diffusion equations, whose dynamics are driven by internal energies…
Recent advances in random-walk particle-tracking have enabled direct simulation of mixing and reactions on particles by allowing the particles to interact with each other using a multi-point mass transfer scheme. The mass transfer scheme…
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces. Convergence is established for a wide class of coupling schemes. Unlike classical alternating algorithms, which are limited to two…
Parallel transport is a fundamental tool to perform statistics on Rie-mannian manifolds. Since closed formulae don't exist in general, practitioners often have to resort to numerical schemes. Ladder methods are a popular class of algorithms…
Taking the triangle areas as independent variables in the theory of Regge calculus can lead to ambiguities in the edge lengths, which can be interpreted as discontinuities in the metric. We construct solutions to area Regge calculus using a…
Reconstruction of evolutionary relationships between species is an important topic in the field of computational biology. Pairwise compatibility graphs (PCGs) are used to model such relationships. A graph is a PCG if its edges can be…
In this paper we consider splitting methods for the time integration of parabolic and certain classes of hyperbolic partial differential equations, where one partial flow can not be computed exactly. Instead, we use a numerical…
Nucleus decompositions have been shown to be a useful tool for finding dense subgraphs. The coreness value of a clique represents its density based on the number of other cliques it is adjacent to. One useful output of nucleus decomposition…
A new lattice based scheme for numerical relativity will be presented. The scheme uses the same data as would be used in the Regge calculus (eg. a set of leg lengths on a simplicial lattice) but it differs significantly in the way that the…
This paper studies the construction of geometric integrators for nonholonomic systems. We derive the nonholonomic discrete Euler-Lagrange equations in a setting which permits to deduce geometric integrators for continuous nonholonomic…
Efficient solutions of large-scale, ill-conditioned and indefinite algebraic equations are ubiquitously needed in numerous computational fields, including multiphysics simulations, machine learning, and data science. Because of their…
In this paper we study semi-discrete and fully discrete evolving surface finite element schemes for the Cahn-Hilliard equation with a logarithmic potential. Specifically we consider linear finite elements discretising space and backward…
In Regge calculus space time is usually approximated by a triangulation with flat simplices. We present a formulation using simplices with constant sectional curvature adjusted to the presence of a cosmological constant. As we will show…
With the development of fast and massively parallel evaluations in many domains, Quality-Diversity (QD) algorithms, that already proved promising in a large range of applications, have seen their potential multiplied. However, we have yet…