A simple multigrid scheme for solving the Poisson equation with arbitrary domain boundaries

We present a new multigrid scheme for solving the Poisson equation with Dirichlet boundary conditions on a Cartesian grid with irregular domain boundaries. This scheme was developed in the context of the Adaptive Mesh Refinement (AMR) schemes based on a graded-octree data structure. The Poisson equation is solved on a level-by-level basis, using a "one-way interface" scheme in which boundary conditions are interpolated from the previous coarser level solution. Such a scheme is particularly well suited for self-gravitating astrophysical flows requiring an adaptive time stepping strategy. By constructing a multigrid hierarchy covering the active cells of each AMR level, we have designed a memory-efficient algorithm that can benefit fully from the multigrid acceleration. We present a simple method for capturing the boundary conditions across the multigrid hierarchy, based on a second-order accurate reconstruction of the boundaries of the multigrid levels. In case of very complex boundaries, small scale features become smaller than the discretization cell size of coarse multigrid levels and convergence problems arise. We propose a simple solution to address these issues. Using our scheme, the convergence rate usually depends on the grid size for complex grids, but good linear convergence is maintained. The proposed method was successfully implemented on distributed memory architectures in the RAMSES code, for which we present and discuss convergence and accuracy properties as well as timing performances.Comment: 33 pages, 15 figures, accepted for publication in Journal of Computational Physic

The Monge-Ampere equation: various forms and numerical methods

We present three novel forms of the Monge-Ampere equation, which is used, e.g., in image processing and in reconstruction of mass transportation in the primordial Universe. The central role in this paper is played by our Fourier integral form, for which we establish positivity and sharp bound properties of the kernels. This is the basis for the development of a new method for solving numerically the space-periodic Monge-Ampere problem in an odd-dimensional space. Convergence is illustrated for a test problem of cosmological type, in which a Gaussian distribution of matter is assumed in each localised object, and the right-hand side of the Monge-Ampere equation is a sum of such distributions.Comment: 24 pages, 2 tables, 5 figures, 32 references. Submitted to J. Computational Physics. Times of runs added, multiple improvements of the manuscript implemented

Order-of-magnitude speedup for steady states and traveling waves via Stokes preconditioning in Channelflow and Openpipeflow

Steady states and traveling waves play a fundamental role in understanding hydrodynamic problems. Even when unstable, these states provide the bifurcation-theoretic explanation for the origin of the observed states. In turbulent wall-bounded shear flows, these states have been hypothesized to be saddle points organizing the trajectories within a chaotic attractor. These states must be computed with Newton's method or one of its generalizations, since time-integration cannot converge to unstable equilibria. The bottleneck is the solution of linear systems involving the Jacobian of the Navier-Stokes or Boussinesq equations. Originally such computations were carried out by constructing and directly inverting the Jacobian, but this is unfeasible for the matrices arising from three-dimensional hydrodynamic configurations in large domains. A popular method is to seek states that are invariant under numerical time integration. Surprisingly, equilibria may also be found by seeking flows that are invariant under a single very large Backwards-Euler Forwards-Euler timestep. We show that this method, called Stokes preconditioning, is 10 to 50 times faster at computing steady states in plane Couette flow and traveling waves in pipe flow. Moreover, it can be carried out using Channelflow (by Gibson) and Openpipeflow (by Willis) without any changes to these popular spectral codes. We explain the convergence rate as a function of the integration period and Reynolds number by computing the full spectra of the operators corresponding to the Jacobians of both methods.Comment: in Computational Modelling of Bifurcations and Instabilities in Fluid Dynamics, ed. Alexander Gelfgat (Springer, 2018

A technique for accelerating iterative convergence in numerical integration, with application in transonic aerodynamics

A technique is described for the efficient numerical solution of nonlinear partial differential equations by rapid iteration. In particular, a special approach is described for applying the Aitken acceleration formula (a simple Pade approximant) for accelerating the iterative convergence. The method finds the most appropriate successive approximations, which are in a most nearly geometric sequence, for use in the Aitken formula. Simple examples are given to illustrate the use of the method. The method is then applied to the mixed elliptic-hyperbolic problem of steady, inviscid, transonic flow over an airfoil in a subsonic free stream

Arc-Length Continuation and Multigrid Techniques for Nonlinear Elliptic Eigenvalue Problems

We investigate multi-grid methods for solving linear systems arising from arc-length continuation techniques applied to nonlinear elliptic eigenvalue problems. We find that the usual multi-grid methods diverge in the neighborhood of singular points of the solution branches. As a result, the continuation method is unable to continue past a limit point in the Bratu problem. This divergence is analyzed and a modified multi-grid algorithm has been devised based on this analysis. In principle, this new multi-grid algorithm converges for elliptic systems, arbitrarily close to singularity and has been used successfully in conjunction with arc-length continuation procedures on the model problem. In the worst situation, both the storage and the computational work are only about a factor of two more than the unmodified multi-grid methods