Related papers: Multigrid Reduction in Time for non-linear hyperbo…
This paper presents a parallel-in-time multilevel iterative method for solving differential algebraic equation, arising from a discretization of linear time-dependent partial differential equation. The core of the method is the multilevel…
The aim of this paper is to apply a high-order discontinuous-in-time scheme to second-order hyperbolic partial differential equations (PDEs). We first discretize the PDEs in time while keeping the spatial differential operators…
We present promising initial results of our adaptive multigrid solver developed for application directly to the non-Hermitian Wilson-Dirac system in 4 dimensions, as opposed to the solver developed in [1] for the corresponding normal…
In this article, we propose novel boundary treatment algorithms to avoid order reduction when implicit-explicit Runge-Kutta time discretization is used for solving convection-diffusion-reaction problems with time-dependent Di\-richlet…
We consider partial differential equations on networks with a small parameter $\epsilon$, which are hyperbolic for $\epsilon>0$ and parabolic for $\epsilon=0$. With a combination of an $\epsilon$-expansion and Runge-Kutta schemes for…
In multiobjective optimization, inertial gradient systems accelerate convergence toward weakly Pareto optimal solutions. To achieve even faster convergence, we introduce a multiobjective inertial gradient system with time scaling (MITS),…
Algebraic multigrid (AMG) is a widely used scalable solver and preconditioner for large-scale linear systems resulting from the discretization of a wide class of elliptic PDEs. While AMG has optimal computational complexity, the cost of…
The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a nonlinear minimization problem under planar equality and/or…
With the increasing number of components and further miniaturization the mean time between faults in supercomputers will decrease. System level fault tolerance techniques are expensive and cost energy, since they are often based on…
We consider geometric multigrid methods for the solution of linear systems arising from isogeometric discretizations of elliptic partial differential equations. For classical finite elements, such methods are well known to be fast solvers…
In the context of Galerkin discretizations of a partial differential equation (PDE), the modes of the classical method of Proper Orthogonal Decomposition (POD) can be interpreted as the ansatz and trial functions of a low-dimensional…
This work considers two boundary correction techniques to mitigate the reduction in the temporal order of convergence in PDE sense (i.e., when both the space and time resolutions tend to zero independently of each other) of $d$ dimension…
In this paper we propose a multigrid optimization algorithm (MG/OPT) for the numerical solution of a class of quasilinear variational inequalities of the second kind. This approach is enabled by the fact that the solution of the variational…
We introduce Algorithm MGB (Multi Grid Barrier) for solving highly nonlinear convex Euler-Lagrange equations. This class of problems includes many highly nonlinear partial differential equations, such as $p$-Laplacians. We prove that, if…
This work introduces a new approach for accelerating the numerical analysis of time-domain partial differential equations (PDEs) governing complex physical systems. The methodology is based on a combination of a classical reduced-order…
The parareal in time algorithm allows to perform parallel simulations of time dependent problems. This algorithm has been implemented on many types of time dependent problems with some success. Recent contributions have allowed to extend…
The weighted essentially non-oscillatory (WENO) schemes are a popular class of high order accurate numerical methods for solving hyperbolic partial differential equations (PDEs). However when the spatial dimensions are high, the number of…
In this paper we present a Local Fourier Analysis of a space-time multigrid solver for a hyperbolic test problem. The space-time discretization is based on arbitrarily high order discontinuous Galerkin spectral element methods in time and a…
An efficient $hp$-multigrid scheme is presented for local discontinuous Galerkin (LDG) discretizations of elliptic problems, formulated around the idea of separately coarsening the underlying discrete gradient and divergence operators. We…
An efficient multigrid framework is developed for the time marching of steady-state compressible flows with a spatially high-order ($p$-order polynomial) modal discontinuous Galerkin method. The core algorithm that based on a global…