arXiv subjects

Wei Leng

Publications and source records attributed to Wei Leng.

11 recordsLinked to original sources

arXiv2021

Parallel Exponential Time Differencing Methods for Geophysical Flow Simulations

Two ocean models are considered for geophysical flow simulations: the multi-layer shallow water equations and the multi-layer primitive equations. For the former, we investigate the parallel performance of exponential time differencing (ETD) methods, including exponential Rosenbrock-Euler, ETD2wave, and B-ETD2wave. For the latter, we take advantage of the splitting of barotropic and baroclinic modes and propose a new two-level method in which an ETD method is applied to solve the fast barotropic mode. These methods could improve the computational efficiency of numerical simulations because ETD methods allow for much larger time step sizes than traditional explicit time-stepping techniques that are commonly used in existing computational ocean models. Several standard benchmark tests for ocean modeling are performed and comparison of the numerical results demonstrate a great potential of applying the parallel ETD methods for simulating real-world geophysical flows.

physics.ao-ph↗

arXiv2020

Trace Transfer-based Diagonal Sweeping Domain Decomposition Method for the Helmholtz Equation: Algorithms and Convergence Analysis

By utilizing the perfectly matched layer (PML) and source transfer techniques, the diagonal sweeping domain decomposition method (DDM) was recently developed for solving the high-frequency Helmholtz equation in $\mathbb{R}^n$, which uses $2^n$ sweeps along respective diagonal directions with checkerboard domain decomposition. Although this diagonal sweeping DDM is essentially multiplicative, it is highly suitable for parallel computing of the Helmholtz problem with multiple right-hand sides when combined with the pipeline processing since the number of sequential steps in each sweep is much smaller than the number of subdomains. In this paper, we propose and analyze a trace transfer-based diagonal sweeping DDM. A major advantage of changing from source transfer to trace transfer for information passing between neighbor subdomains is that the resulting diagonal sweeps become easier to analyze and implement and more efficient, since the transferred traces have only $2n$ cardinal directions between neighbor subdomains while the transferred sources come from a total of $3^n-1$ cardinal and corner directions. We rigorously prove that the proposed diagonal sweeping DDM not only gives the exact solution of the global PML problem in the constant medium case but also does it with at most one extra round of diagonal sweeps in the two-layered media case, which lays down the theoretical foundation of the method. Performance and parallel scalability of the proposed DDM as direct solver or preconditioner are also numerically demonstrated through extensive experiments in two and three dimensions.

math.NA↗

arXiv2020

A diagonal sweeping domain decomposition method with source transfer for the Helmholtz equation

In this paper, we propose and test a novel diagonal sweeping domain decomposition method (DDM) with source transfer for solving the high-frequency Helmholtz equation in $\mathbb{R}^n$. In the method the computational domain is partitioned into overlapping checkerboard subdomains for source transfer with the perfectly matched layer (PML) technique, then a set of diagonal sweeps over the subdomains are specially designed to solve the system efficiently. The method improves the additive overlapping DDM (W. Leng and L. Ju, 2019) and the L-sweeps method (M. Taus, et al., 2019) by employing a more efficient subdomain solving order. We show that the method achieves the exact solution of the global PML problem with $2^n$ sweeps in the constant medium case. Although the sweeping usually implies sequential subdomain solves, the number of sequential steps required for each sweep in the method is only proportional to the $n$-th root of the number of subdomains when the domain decomposition is quasi-uniform with respect to all directions, thus it is very suitable for parallel computing of the Helmholtz problem with multiple right-hand sides through the pipeline processing. Extensive numerical experiments in two and three dimensions are presented to demonstrate the effectiveness and efficiency of the proposed method.

math.NA↗

arXiv2019

High Order Explicit Local Time-Stepping Methods For Hyperbolic Conservation Laws

In this paper we present and analyze a general framework for constructing high order explicit local time stepping (LTS) methods for hyperbolic conservation laws. In particular, we consider the model problem discretized by Runge-Kutta discontinuous Galerkin (RKDG) methods and design LTS algorithms based on strong stability preserving Runge-Kutta (SSP-RK) schemes, that allow spatially variable time step sizes to be used for time integrations in different regions. The proposed algorithms are of predictor-corrector type, in which the interface information along the time direction is first predicted based on the SSP-RK approximations and Taylor expansions, and then the fluxes over the region of interface are corrected to conserve mass exactly at each time step. Following the proposed framework, we detail the corresponding LTS schemes with accuracy up to the fourth order, and prove their conservation property and nonlinear stability for the scalar conservation laws. Numerical experiments are also presented to demonstrate excellent performance of the proposed LTS algorithms.

math.NA↗

arXiv2018

An Additive Overlapping Domain Decomposition Method for the Helmholtz Equation

In this paper, we propose and analyze an additive domain decomposition method (DDM) for solving the high-frequency Helmholtz equation with the Sommerfeld radiation condition. In the proposed method, the computational domain is partitioned into structured subdomains along all spatial directions, and each subdomain contains an overlapping region for source transferring. At each iteration all subdomain PML problems are solved completely in parallel, then all horizontal, vertical and corner directional residuals on each subdomain are passed to its corresponding neighbor subdomains as the source for the next iteration. This DDM method is highly scalable in nature and theoretically shown to produce the exact solution for the PML problem defined in ${\mathbb{R}}^2$ in the constant medium case. A slightly modified version of the method for bounded truncated domains is also developed for its use in practice and an error estimate is rigorously proved. Various numerical experiments in two and three dimensions are conducted on the supercomputer "Tianhe-2 Cluster" to verify the theoretical results and demonstrate excellent performance of the proposed method as an iterative solver or a preconditioner.

math.NA↗

arXiv2017

An hp-adaptive strategy for elliptic problems

In this paper a new hp-adaptive strategy for elliptic problems based on refinement history is proposed, which chooses h-, p- or hp-refinement on individual elements according to a posteriori error estimate, as well as smoothness estimate of the solution obtained by comparing the actual and expected error reduction rate. Numerical experiments show that exponential convergence can be achieved with this strategy.

math.NA↗

arXiv2017

Dynamic load balancing for large-scale adaptive finite element computation

For the parallel computation of partial differential equations, one key is the grid partitioning. It requires that each process owns the same amount of computations, and also, the partitioning quality should be proper to reduce the communications among processes. When calculating the partial differential equations using adaptive finite element methods, the grid and the basis functions adjust in each iteration, which introduce load balancing issues. The grid should be redistributed dynamically. This paper studies dynamic load balancing algorithms and the implementation on the adaptive finite element platform PHG. The numerical experiments show that algorithms studied in this paper have good partitioning quality, and they are efficient.

cs.DC↗

arXiv2016

Encoding and Decoding Algorithms for Arbitrary Dimensional Hilbert Order

Hilbert order is widely applied in many areas. However, most of the algorithms are confined to low dimensional cases. In this paper, algorithms for encoding and decoding arbitrary dimensional Hilbert order are presented. Eight algorithms are proposed. Four algorithms are based on arithmetic operations and the other four algorithms are based on bit operations. For the algorithms complexities, four of them are linear and the other four are constant for given inputs. In the end of the paper, algorithms for two dimensional Hilbert order are presented to demonstrate the usage of the algorithms introduced.

cs.SC↗

arXiv2015

An Overlapping Domain Decomposition Preconditioner for the Helmholtz equation

In this paper, based on the overlapping domain decomposition method (DDM) proposed in \cite{Leng2015}, an one step preconditioner is proposed to solve 2D high frequency Helmholtz equation. The computation domain is decomposed in both $x$ and $y$ directions, and the local solution on each subdomain is updated simultaneously in one iteration, thus there is no sweeping along certain directions. In these ways, the overlapping DDM is similar to the popular DDM for Poisson problem. The one step preconditioner simply take the restricted source on each subdomain, solve the local problems and summarize the local solutions on all subdomains including their PML area. The complexity of solving the problem with the preconditioner is $O(N n_{\text{iter}})$, where $n_{\text{iter}}$ is the number of iteration, and it is shown numerically that $n_{\text{iter}}$ is proportional to the number of subdomains in one direction. 2D Helmholtz problem with nearly a billion unknowns are solved efficiently with the preconditioner on massively parallel machines.

math.NA↗

arXiv2015

A Fast Propagation Method for the Helmholtz equation

A fast method is proposed for solving the high frequency Helmholtz equation. The building block of the new fast method is an overlapping source transfer domain decomposition method for layered medium, which is an extension of the source transfer domain decomposition method proposed by Chen and Xiang \cite{Chen2013a,Chen2013b}. The new fast method contains a setup phase and a solving phase. In the setup phase, the computation domain is decomposed hierarchically into many subdomains of different levels, and the mapping from incident traces to field traces on all the subdomains are set up bottom-up. In the solving phase, first on the bottom level, the local problem on the subdomains with restricted source is solved, then the wave propagates on the boundaries of all the subdomains bottom-up, at last the local solutions on all the subdomains are summed up top-down. The total computation cost of the new fast method is $O(n^{\frac{3}{2}} \log n)$ for 2D problem. Numerical experiments shows that with the new fast method, Helmholtz equations with half billion unknowns could be solved efficiently on massively parallel machines.

math.NA↗

arXiv2012

A Scalable Auxiliary Space Preconditioner for High-Order Finite Element Methods

In this paper, we revisit an auxiliary space preconditioning method proposed by Xu [Computing 56, 1996], in which low-order finite element spaces are employed as auxiliary spaces for solving linear algebraic systems arising from high-order finite element discretizations. We provide a new convergence rate estimate and parallel implementation of the proposed algorithm. We show that this method is user-friendly and can play an important role in a variety of Poisson-based solvers for more challenging problems such as the Navier--Stokes equation. We investigate the performance of the proposed algorithm using the Poisson equation and the Stokes equation on 3D unstructured grids. Numerical results demonstrate the advantages of the proposed algorithm in terms of efficiency, robustness, and parallel scalability.

math.NA↗