ACAndrew Christlieb

Andrew Christlieb

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Andrew Christlieb has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Competition and Complexity in Amphiphilic Polymer Morphology

    by Andrew Christlieb, Noa Kraitzman, Keith Promislow

    We analyze the competitive evolution of codimension one and two morphologies within the $H^{-1}$ gradient flow of the strong Functionalized Cahn-Hilliard equation. On a slow time scale a sharp hypersurface reduction yields a degenerate Mullins-Sekerka evolution for both codimension one and two hypersurfaces, leading to a geometric flow that depends locally on curvatures couples to the dynamic value of the spatially constant far-field chemical potential. Both codimension one and two morphologies admit two classes of bifurcations, one leads to pearling, a short-wavelength in-plane modulation of interfacial width, the other flips motion by curvature to the locally-ill posed motion against curvature, which leads to fingering instabilities. We present a bifurcation diagram for the morphological competition, and compare our results quantitatively to simulations of the full system and qualitatively to simulations of self-consistent mean field models and laboratory experiments; illuminating the role of the pearling bifurcation in the development of complex network morphologies.

  • Open Access

    Method of lines transpose: Energy gradient flows using direct operator inversion for phase field models

    by Matthew Causley, Hana Cho, Andrew Christlieb

    In this work, we develop an $\mathcal{O}(N)$ implicit real space method in 1D and 2D for the Cahn Hilliard (CH) and vector Cahn Hilliard (VCH) equations, based on the Method Of Lines Transpose (MOL$^\text{T}$) formulation. This formulation results in a semi-discrete time stepping algorithm, which we prove is gradient stable in the $H^{-1}$ norm. The spatial discretization follows from dimensional splitting, and an $\mathcal{O}(N)$ matrix-free solver, which applies fast convolution to the modified Helmholtz equation. We propose a novel factorization technique, in which fourth order spatial derivatives are incorporated into the solver. The splitting error is included in the nonlinear fixed point iteration, resulting in a high order, logically Cartesian (line-by-line) update. Our method is fast, but not restricted to periodic boundaries like the fast Fourier transform (FFT). The basic solver is implemented using the Backward Euler formulation, and we extend this to both backward difference (BDF) stencils, implicit Runge Kutta (SDIRK) and spectral deferred correction (SDC) frameworks to achieve high orders of temporal accuracy. We demonstrate with numerical results that the CH, and VCH equations maintain gradient stability in one and two spatial dimensions. We also explore time-adaptivity, so that meta-stable states and ripening events can be simulated both quickly and efficiently.

  • Open Access

    A WENO-based Method of Line Transpose Approach for Vlasov Simulations

    by Andrew Christlieb, Wei Guo, Yan Jiang

    In this paper, a high order implicit Method of Line Transpose (MOL$^T$ ) method based on a weighted essentially non-oscillatory (WENO) methodology is developed for one-dimensional linear transport equations and further applied to the Vlasov-Poisson (VP) simulations via dimensional splitting. In the MOL$^T$ framework, the time variable is first discretized by a diagonally implicit strong-stability-preserving Runge-Kutta method, resulting in a boundary value problem (BVP) at the discrete time levels. Then an integral formulation coupled with a high order WENO methodology is employed to solve the BVP. As a result, the proposed scheme is high order accurate in both space and time and free of oscillations even though the solution is discontinuous or has sharp gradients. Moreover, the scheme is able to take larger time step evolution compared with an explicit MOL WENO scheme with the same order of accuracy. The desired positivity-preserving (PP) property of the scheme is further attained by incorporating a newly proposed high order PP limiter. We perform numerical experiments on several benchmarks including linear advection, solid body rotation problem; and on the Landau damping, two-stream instabilities, bump-on-tail, and plasma sheath by solving the VP system. The efficacy and efficiency of the proposed scheme is numerically verified.

  • Open Access

    An Asymptotic Preserving Maxwell Solver Resulting in the Darwin Limit of Electrodynamics

    by Yingda Cheng, Andrew J. Christlieb, Wei Guo, Benjamin Ong

    In plasma simulations, where the speed of light divided by a characteristic length is at a much higher frequency than other relevant parameters in the underlying system, such as the plasma frequency, implicit methods begin to play an important role in generating efficient solutions in these multi-scale problems. Under conditions of scale separation, one can rescale Maxwell's equations in such a way as to give a magneto static limit known as the Darwin approximation of electromagnetics. In this work, we present a new approach to solve Maxwell's equations based on a Method of Lines Transpose (MOL$^T$) formulation, combined with a fast summation method with computational complexity $O(N\log{N})$, where $N$ is the number of grid points (particles). Under appropriate scaling, we show that the proposed schemes result in asymptotic preserving methods that can recover the Darwin limit of electrodynamics.

  • Open Access

    An Adaptive WENO Collocation Method for Differential Equations with Random Coefficients

    by Wei Guo, Guang Lin, Andrew J. Christlieb, Jingmei Qiu

    The stochastic collocation method for solving differential equations with random inputs has gained lots of popularity in many applications, since such a scheme exhibits exponential convergence with smooth solutions in the random space. However, in some circumstance the solutions do not fulfill the smoothness requirement; thus a direct application of the method will cause poor performance and slow convergence rate due to the well known Gibbs phenomenon. To address the issue, we propose an adaptive high-order multi-element stochastic collocation scheme by incorporating a WENO (Weighted Essentially non-oscillatory) interpolation procedure and an adaptive mesh refinement (AMR) strategy. The proposed multi-element stochastic collocation scheme requires only repetitive runs of an existing deterministic solver at each interpolation point, similar to the Monte Carlo method. Furthermore, the scheme takes advantage of robustness and the high-order nature of the WENO interpolation procedure, and efficacy and efficiency of the AMR strategy. When the proposed scheme is applied to stochastic problems with non-smooth solutions, the Gibbs phenomenon is mitigated by the WENO methodology in the random space, and the errors around discontinuities in the stochastic space are significantly reduced by the AMR strategy. The numerical experiments for some benchmark stochastic problems, such as the Kraichnan-Orszag problem and Burgers’ equation with random initial conditions, demonstrate the reliability, efficiency and efficacy of the proposed scheme.


  • Open Access

    Method of lines transpose: High order L-stable O(N) schemes for parabolic equations using successive convolution

    by Matthew F. Causley, Hana Cho, Andrew J. Christlieb, David C. Seal

    We present a new solver for nonlinear parabolic problems that is L-stable and achieves high order accuracy in space and time. The solver is built by first constructing a single-dimensional heat equation solver that uses fast O(N) convolution. This fundamental solver has arbitrary order of accuracy in space, and is based on the use of the Green's function to invert a modified Helmholtz equation. Higher orders of accuracy in time are then constructed through a novel technique known as successive convolution (or resolvent expansions). These resolvent expansions facilitate our proofs of stability and convergence, and permit us to construct schemes that have provable stiff decay. The multi-dimensional solver is built by repeated application of dimensionally split independent fundamental solvers. Finally, we solve nonlinear parabolic problems by using the integrating factor method, where we apply the basic scheme to invert linear terms (that look like a heat equation), and make use of Hermite-Birkhoff interpolants to integrate the remaining nonlinear terms. Our solver is applied to several linear and nonlinear equations including heat, Allen-Cahn, and the Fitzhugh-Nagumo system of equations in one and two dimensions.

  • Open Access

    High Order Maximum Principle Preserving Semi-Lagrangian Finite Difference WENO schemes for the Vlasov Equation

    by Tao Xiong, Jing-Mei Qiu, Zhengfu Xu, Andrew Christlieb

    In this paper, we propose the parametrized maximum principle preserving (MPP) flux limiter, originally developed in [Z. Xu, Math. Comp., (2013), in press], to the semi- Lagrangian finite difference weighted essentially non-oscillatory scheme for solving the Vlasov equation. The MPP flux limiter is proved to maintain up to fourth order accuracy for the semi-Lagrangian finite difference scheme without any time step restriction. Numerical studies on the Vlasov-Poisson system demonstrate the performance of the proposed method and its ability in preserving the positivity of the probability distribution function while maintaining the high order accuracy.

  • Open Access

    Parallel Semi-Implicit Time Integrators

    by Benjamin Ong, Andrew Melfi, Andrew Christlieb

    In this paper, we further develop a family of parallel time integrators known as Revisionist Integral Deferred Correction methods (RIDC) to allow for the semi-implicit solution of time dependent PDEs. Additionally, we show that our semi-implicit RIDC algorithm can harness the computational potential of multiple general purpose graphical processing units (GPUs) in a single node by utilizing existing CUBLAS libraries for matrix linear algebra routines in our implementation. In the numerical experiments, we show that our implementation computes a fourth order solution using four GPUs and four CPUs in approximately the same wall clock time as a first order solution computed using a single GPU and a single CPU.