Related papers: A comparative study on low-memory iterative solver…

We present a parallel computing strategy for a hybridizable discontinuous Galerkin (HDG) nested geometric multigrid (GMG) solver. Parallel GMG solvers require a combination of coarse-grain and fine-grain parallelism to improve time to…

Computing accurate periodic responses in strongly nonlinear or even non-smooth vibration systems remains a fundamental challenge in nonlinear dynamics. Existing numerical methods, such as the Harmonic Balance Method (HBM) and the Shooting…

We propose and analyze an iterative high-order hybridized discontinuous Galerkin (iHDG) discretization for linear partial differential equations. We improve our previous work (SIAM J. Sci. Comput. Vol. 39, No. 5, pp. S782--S808) in several…

Isogeometric Analysis (IgA) has become a viable alternative to the Finite Element Method (FEM) and is typically combined with a time integration scheme within the method of lines for time-dependent problems. However, due to a stagnation of…

In this paper, we design a new iterative algorithm for solving pseudomonotone equilibrium problems in real Hilbert spaces. The advantage of our algorithm is that it requires only one strongly convex programming problem at each iteration.…

In this paper, we investigate a spectral Petrov-Galerkin method for fractional initial value problems. Singularities of the solution at the origin inherited from the weakly singular kernel of the fractional derivative are considered, and…

Of all the possible projection methods for solving large-scale Lyapunov matrix equations, Galerkin approaches remain much more popular than minimal-residual ones. This is mainly due to the different nature of the projected problems stemming…

This article proposes a novel least-squares weak Galerkin (LS-WG) method for second-order elliptic equations in non-divergence form. The approach leverages a locally defined discrete weak Hessian operator constructed within the weak…

The Conjugate Gradient method (CGM) is known to be the fastest generic iterative method for solving linear systems with symmetric sign definite matrices. In this paper, we modify this method so that it could find fundamental solitary waves…

This paper introduces a new method based on Deep Galerkin Methods (DGMs) for solving high-dimensional stochastic Mean Field Games (MFGs). We achieve this by using two neural networks to approximate the unknown solutions of the MFG system…

We analyse and compare several algorithms to compute numerically periodic solutions of high-dimensional dynamical systems and investigate their Floquet stability without building the monodromy matrix. The solution and its perturbation are…

Interior-point methods for linear programming problems require the repeated solution of a linear system of equations. Solving these linear systems is non-trivial due to the severe ill-conditioning of the matrices towards convergence. This…

The image quality of the new generation of earthbound Extremely Large Telescopes (ELTs) is heavily influenced by atmospheric turbulences. To compensate these optical distortions a technique called adaptive optics (AO) is used. Many AO…

This work concerns the numerical solution of a coupled system of self-consistent reaction-drift-diffusion-Poisson equations that describes the macroscopic dynamics of charge transport in photoelectrochemical (PEC) solar cells with reactive…

The Legendre spectral Galerkin method of self-adjoint second order elliptic equations usually results in a linear system with a dense and ill-conditioned coefficient matrix. In this paper, the linear system is solved by a preconditioned…

We construct solvers for an isogeometric multi-patch discretization, where the patches are coupled via a discontinuous Galerkin approach, which allows the consideration of discretizations that do not match on the interfaces. We solve the…

We present a scalable iterative solver for high-order hybridized discontinuous Galerkin (HDG) discretizations of linear partial differential equations. It is an interplay between domain decomposition methods and HDG discretizations, and…

We extend the semi-Lagrangian discontinuous Galerkin (SLDG) method of Einkemmer to velocity grids with adaptive mesh refinement (AMR) and to three-dimensional velocity space. The original SLDG formulation assumes uniform cell widths, which…

With the steady advance of high performance computing systems featuring smaller and smaller hardware components, the systems and algorithms used for numerical simulations increasingly contend with disruptions caused by hardware failures and…

In this paper we introduce a novel quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin variable elimination procedure, but by case splitting we are able to…