Related papers: A fast and robust computational method for the ion…
We discuss how multi-grid computing schemes can be used to design hierarchical coordination architectures for energy systems. These hierarchical architectures can be used to manage multiple temporal and spatial scales and mitigate…
We present a polynomial multigrid method for nodal interior penalty and local discontinuous Galerkin formulations of the Poisson equation on Cartesian grids. For smoothing we propose two classes of overlapping Schwarz methods. The first…
Multigrid methods have proven to be an invaluable tool to efficiently solve large sparse linear systems arising in the discretization of partial differential equations (PDEs). Algebraic multigrid methods and in particular adaptive algebraic…
We present a novel numerical method and algorithm for the solution of the 3D axially symmetric time-dependent Schr\"odinger equation in cylindrical coordinates, involving singular Coulomb potential terms besides a smooth time-dependent…
In this paper, we propose a family of time-stepping schemes for approximating general nonlinear Schr\"odinger equations. The proposed schemes all satisfy both mass conservation and energy conservation. Truncation and dispersion error…
Two non-equidistant grid implementations of infinite range exterior complex scaling are introduced that allow for perfect absorption in the time dependent Schr\"odinger equation. Finite element discrete variables grid discretizations…
This paper is concerned with developing an efficient numerical algorithm for fast implementation of the sparse grid method for computing the $d$-dimensional integral of a given function. The new algorithm, called the MDI-SG ({\em multilevel…
A collision-based hybrid algorithm for the discrete ordinates approximation of the neutron transport equation is extended to the multigroup setting. The algorithm uses discrete energy and angle grids at two different resolutions and…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
A cascadic multigrid method is proposed for eigenvalue problems based on the multilevel correction scheme. With this new scheme, an eigenvalue problem on the finest space can be solved by smoothing steps on a series of multilevel finite…
We evaluate an efficient overset grid method for two-dimensional and three-dimensional particulate flows for small numbers of particles at finite Reynolds number. The rigid particles are discretised using moving overset grids overlaid on a…
A general real-space multigrid algorithm MIKA (Multigrid Instead of the K-spAce) for the self-consistent solution of the Kohn-Sham equations appearing in the state-of-the-art electronic-structure calculations is described. The most…
We consider the coupled system of equations that describe flow in fractured porous media. To describe such types of problems, multicontinuum and multiscale approaches are used. Because in multicontinuum models, the permeability of each…
Large-scale overlapping problems are prevalent in practical engineering applications, and the optimization challenge is significantly amplified due to the existence of shared variables. Decomposition-based cooperative coevolution (CC)…
The geometric multigrid method (GMG) is one of the most efficient solving techniques for discrete algebraic systems arising from elliptic partial differential equations. GMG utilizes a hierarchy of grids or discretizations and reduces the…
Brute-force simulations for dynamics on very large networks are quite expensive. While phenomenological treatments may capture some macroscopic properties, they often ignore important microscopic details. Fortunately, one may be only…
The geometric multigrid algorithm is an efficient numerical method for solving a variety of elliptic partial differential equations (PDEs). The method damps errors at progressively finer grid scales, resulting in faster convergence compared…
We present a deep learning approach for computing multi-phase solutions to the semiclassical limit of the Schr\"odinger equation. Traditional methods require deriving a multi-phase ansatz to close the moment system of the Liouville…
Isogeometric Analysis is a high-order discretization method for boundary value problems that uses a number of degrees of freedom which is as small as for a low-order method. Standard isogeometric discretizations require a global…
We show that the method of splitting the operator ${\rm e}^{\epsilon(T+V)}$ to fourth order with purely positive coefficients produces excellent algorithms for solving the time-dependent Schr\"odinger equation. These algorithms require…