ACAndrew J. Christlieb

Andrew J. 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 J. Christlieb has a total of 47 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Boundary Corrections for Kernel Approximation to Differential Operators

    by Andrew Christlieb, Sining Gong, Hyoseon Yang

    The kernel-based approach to operator approximation for partial differential equations has been shown to be unconditionally stable for linear PDEs and numerically exhibit unconditional stability for non-linear PDEs. These methods have the same computational cost as an explicit finite difference scheme but can exhibit order reduction at boundaries. In previous work on periodic domains, [9, 10], order reduction was addressed, yielding high-order accuracy. The issue addressed in this work is the elimination of order reduction of the kernel-based approach for a more general set of boundary conditions. Further, we consider the case of both first and second order operators. To demonstrate the theory, we provide not only the mathematical proofs but also experimental results by applying various boundary conditions to different types of equations. The results agree with the theory, demonstrating a systematic path to high order for kernel-based methods on bounded domains.


  • Open Access

    A Semi-Lagrangian Adaptive Rank (SLAR) Method for High-Dimensional Vlasov Dynamics

    by Nanyi Zheng, William A. Sands, Daniel Hayes, Andrew J. Christlieb, Jing-Mei Qiu

    We extend our previous work on a semi-Lagrangian adaptive rank (SLAR) integrator, in the finite difference framework for nonlinear Vlasov-Poisson systems, to the general high-order tensor setting. The proposed scheme retains the high-order accuracy of semi-Lagrangian methods, ensuring stability for large time steps and avoiding dimensional splitting errors. The primary contribution of this paper is the novel extension of the algorithm from the matrix to the high-dimensional tensor setting, which enables the simulation of Vlasov models in up to six dimensions. The key technical components include (1) a third-order high-dimensional polynomial reconstruction that scales as $O(d^2)$, providing a point-wise approximation of the solution at the foot of characteristics in a semi-Lagrangian scheme; (2) a recursive hierarchical adaptive cross approximation of high-order tensors in a hierarchical Tucker format, characterized by a tensor tree; (3) a low-complexity Poisson solver in the hierarchical Tucker format that leverages the FFT for efficiency. The computed adaptive rank kinetic solutions exhibit low-rank structures within branches of the tensor tree resulting in substantial computational savings in both storage and time. The resulting algorithm achieves a computational complexity of $O(d^4 N r^{3+\lceil\log_2d\rceil})$, where $N$ is the number of grid points per dimension, $d$ is the problem dimension, and $r$ is the maximum rank in the tensor tree, overcoming the curse of dimensionality. Through extensive numerical tests, we demonstrate the efficiency of the proposed algorithm and highlight its ability to capture complex solution structures while maintaining a computational complexity that scales linearly with $N$.

  • Open Access

    A Sampling-Based Adaptive Rank Approach to the Wigner-Poisson System

    by Andrew Christlieb, Sining Gong, Jing-Mei Qiu, Nanyi Zheng

    We develop a mass-conserving, adaptive-rank solver for the 1D1V Wigner-Poisson system. Our work is motivated by applications to the study of the stopping power of $α$ particles at the National Ignition Facility (NIF). In this regime, electrons are in a warm dense state, requiring more than a standard kinetic model. They are hot enough to neglect Pauli exclusion, yet quantum enough to require accounting for uncertainty. The Wigner-Poisson system captures these effects but presents challenges due to its nonlocal nature. Based on a second-order Strang splitting method, we first design a full-rank solver with a structure-preserving Fourier update that ensures the intermediate solutions remain real-valued (up to machine precision), improving upon previous methods. Simulations demonstrate that the solutions exhibit a low rank structure for moderate to high dimensionless Planck constants ($H \ge 0.1$). This observed low rank structure motivates the development of an adaptive-rank solver, built on a Semi-Lagrangian adaptive-rank (SLAR) scheme for advection and an adaptive-rank, structure-preserving Fourier update for the Wigner integral terms, with a rigorous proof of structure-preserving property provided. Our solver achieves $O(N)$ complexity in both storage and computation time, while preserving mass and maintaining momentum accuracy up to the truncation error. The adaptive rank simulations are visually indistinguishable from the full-rank simulations in capturing solution structures. These results highlight the potential of adaptive rank methods for high-dimensional Wigner-Poisson simulations, paving the way toward fully kinetic studies of stopping power in warm dense plasmas.

  • Open Access

    A Particle-in-cell Method for Plasmas with A Generalized Momentum Formulation, Part III: A family of Gauge Conserving Methods

    by Andrew J. Christlieb, William A. Sands, Stephen R. White

    In this paper, we introduce a new family of spatially co-located field solvers for particle-in-cell applications which evolve the potential formulation of Maxwell’s equations under the Lorenz gauge. Our recent work [2] introduced the concept of time-consistency, which connects charge conservation to the preservation of the gauge at the semi-discrete level. It will be shown that there exists a large family of time discretizations which satisfy this property. Additionally, it will be further shown that for large classes of time marching methods, the satisfaction of the gauge condition automatically implies the satisfaction of Gauss’s law for electricity, with the potential formulation ensuring that that Gauss’s law for magnetism is satisfied by definition. We focus on popular time marching methods including centered differences, backward differences, and diagonally-implicit Runge-Kutta methods, which are coupled to a spectral discretization in space. We demonstrate the theory by testing the methods on a relativistic Weibel instability and a drifting cloud of electrons.

  • Open Access

    Benchmark Computation of Morphological Complexity in the Functionalized Cahn-Hilliard Gradient Flow

    by Andrew Christlieb, Keith Promislow, Zengqiang Tan, Sulin Wang, Brian Wetton, Steven M. Wise

    Reductions of the self-consistent mean field theory model of amphiphilic molecules in solvent can lead to a singular family of functionalized Cahn-Hilliard (FCH) energies. We modify these energies, mollifying the singularities to stabilize the computation of the gradient flows and develop a series of benchmark problems that emulate the “morphological complexity” observed in experiments. These benchmarks investigate the delicate balance between the rate of absorption of amphiphilic material onto an interface and a least energy mechanism to disperse the arriving mass. The result is a trichotomy of responses in which two-dimensional interfaces either lengthen by a regularized motion against curvature, undergo pearling bifurcations, or split directly into networks of interfaces. We evaluate a number of schemes that use second order backward differentiation formula (BDF2) type time stepping coupled with Fourier pseudo-spectral spatial discretization. The BDF2-type schemes are either based on a fully implicit time discretization with a preconditioned steepest descent (PSD) nonlinear solver or upon linearly implicit time discretization based on the standard implicit-explicit (IMEX) and the scalar auxiliary variable (SAV) approaches. We add an exponential time differencing (ETD) scheme for comparison purposes. All schemes use a fixed local truncation error target with adaptive time-stepping to achieve the error target. Each scheme requires proper “preconditioning” to achieve robust performance that can enhance efficiency by several orders of magnitude. The nonlinear PSD scheme achieves the smallest global discretization error at fixed local truncation error, however the IMEX and SAV schemes are the most computationally efficient as measured by the number of Fast Fourier Transform (FFT) calls required to achieve a desired global error. Indeed the performance of the SAV scheme directly mirrors that of IMEX, modulo a factor of 1.4 in FFT calls for the auxiliary variable system.