No Arabic abstract
We present a wavelet-based adaptive method for computing 3D multiscale flows in complex, time-dependent geometries, implemented on massively parallel computers. While our focus is on simulations of flapping insects, it can be used for other flow problems, including turbulence, as well. The incompressible fluid is modeled with an artificial compressibility approach in order to avoid solving elliptical problems. No-slip and in/outflow boundary conditions are imposed using volume penalization. The governing equations are discretized on a locally uniform Cartesian grid with centered finite differences, and integrated in time with a Runge--Kutta scheme, both of 4th order. The domain is partitioned into cubic blocks with equidistant grids with different resolution and, for each block, biorthogonal interpolating wavelets are used as refinement indicators and prediction operators. Thresholding the wavelet coefficients allows to generate dynamically evolving grids, and an adaption strategy tracks the solution in both space and scale. Blocks are distributed among MPI processes and the global topology of the grid is encoded using a tree-like data structure. Analyzing the different physical and numerical parameters allows balancing their individual error contributions and thus ensures optimal convergence while minimizing computational effort. Different validation tests score accuracy and performance of our new open source code, WABBIT (Wavelet Adaptive Block-Based solver for Interactions with Turbulence), on massively parallel computers using fully adaptive grids. Flow simulations of flapping insects demonstrate its applicability to complex, bio-inspired problems.
We introduce a new efficient algorithm for Helmholtz problems in perforated domains with the design of the scheme allowing for possibly large wavenumbers. Our method is based upon the Wavelet-based Edge Multiscale Finite Element Method (WEMsFEM) as proposed recently in [14]. For a regular coarse mesh with mesh size H, we establish O(H) convergence of this algorithm under the resolution assumption, and with the level parameter being sufficiently large. The performance of the algorithm is demonstrated by extensive 2-dimensional numerical tests including those motivated by photonic crystals.
In this work, an $r$-linearly converging adaptive solver is constructed for parabolic evolution equations in a simultaneous space-time variational formulation. Exploiting the product structure of the space-time cylinder, the family of trial spaces that we consider are given as the spans of wavelets-in-time and (locally refined) finite element spaces-in-space. Numerical results illustrate our theoretical findings.
In the presence of strong heterogeneities, it is well known that the use of explicit schemes for the transport of species in a porous medium suffers from severe restrictions on the time step. This has led to the development of implicit schemes that are increasingly favoured by practitioners for their computational efficiency. The transport equation requires knowledge of the velocity field, which results from an elliptic problem (Darcy problem) that is the most expensive part of the computation. When considering large reservoirs, a cost-effective way of approximating the Darcy problems is using multiscale domain decomposition (MDD) methods. They allow for the pressure and velocity fields to be computed on coarse meshes (large scale), while detailed basis functions are defined locally, usually in parallel, in a much finer grid (small scale). In this work we adopt the Multiscale Robin Coupled Method (MRCM, [Guiraldello, et al., J. Comput. Phys., 355 (2018) pp. 1-21], [Rocha, et al., J. Comput. Phys., (2020) 109316]), which is a generalization of previous MDD methods that allows for great flexibility in the choice of interface spaces. In this article we investigate the combination of the MRCM with implicit transport schemes. A sequentially implicit strategy is proposed, with different trust-region algorithms ensuring the convergence of the transport solver. The method is assessed on several very stringent 2D two-phase problems, demonstrating its stability even for large time steps. It is also shown that the best accuracy is achieved by considering recently introduced non-polynomial interface spaces, since polynomial spaces are not optimal for high-contrast channelized permeability fields.
In this work we formulate and test a new procedure, the Multiscale Perturbation Method for Two-Phase Flows (MPM-2P), for the fast, accurate and naturally parallelizable numerical solution of two-phase, incompressible, immiscible displacement in porous media approximated by an operator splitting method. The proposed procedure is based on domain decomposition and combines the Multiscale Perturbation Method (MPM) with the Multiscale Robin Coupled Method (MRCM). When an update of the velocity field is called by the operator splitting algorithm, the MPM-2P may provide, depending on the magnitude of a dimensionless algorithmic parameter, an accurate and computationally inexpensive approximation for the velocity field by reusing previously computed multiscale basis functions. Thus, a full update of all multiscale basis functions required by the MRCM for the construction of a new velocity field is avoided. There are two main steps in the formulation of the MPM-2P. Initially, for each subdomain one local boundary value problem with trivial Robin boundary conditions is solved (instead of a full set of multiscale basis functions, that would be required by the MRCM). Then, the solution of an inexpensive interface problem provides the velocity field on the skeleton of the decomposition of the domain. The resulting approximation for the velocity field is obtained by downscaling. We consider challenging two-phase flow problems, with high-contrast permeability fields and water-oil finger growth in homogeneous media. Our numerical experiments show that the use of the MPM-2P gives exceptional speed-up - almost 90% of reduction in computational cost - of two-phase flow simulations. Hundreds of MRCM solutions can be replaced by inexpensive MPM-2P solutions, and water breakthrough can be simulated with very few updates of the MRCM set of multiscale basis functions.
We present a multiscale continuous Galerkin (MSCG) method for the fast and accurate stochastic simulation and optimization of time-harmonic wave propagation through photonic crystals. The MSCG method exploits repeated patterns in the geometry to drastically decrease computational cost and incorporates the following ingredients: (1) a reference domain formulation that allows us to treat geometric variability resulting from manufacturing uncertainties; (2) a reduced basis approximation to solve the parametrized local subproblems; (3) a gradient computation of the objective function; and (4) a model and variance reduction technique that enables the accelerated computation of statistical outputs by exploiting the statistical correlation between the MSCG solution and the reduced basis approximation. The proposed method is thus well suited for both deterministic and stochastic simulations, as well as robust design of photonic crystals. We provide convergence and cost analysis of the MSCG method, as well as a simulation results for a waveguide T-splitter and a Z-bend to illustrate its advantages for stochastic simulation and robust design.