Andrew Christlieb
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Andrew Christlieb has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Benjamin W. Ong
Michigan Technological University
2 shared publications Colin Macdonald
Mathematical Institute, Oxford University, Oxford, OX2 6GG, United Kingdom
1 shared publicationDavid Lawlor
1 shared publication- David Matthew Bortz
University of Colorado Boulder
1 shared publication - Lee Van Groningen
Department of Mathematics, Anderson University, Anderson, Indiana 46012
1 shared publication - Matthew F. Causley
Department of Mathematics, Michigan State University, East Lansing, Michigan 48824
1 shared publication
Latest Publications
- 27 March 2015
- Published by Mathematical Sciences Publishers in Communications in Applied Mathematics and Computational Science
- Vol. 10 (1) , 1-25
Revisionist integral deferred correction with adaptive step-size control
Adaptive stepsize control is a critical feature for the robust and efficient numerical solution of initial-value problems in ordinary differential equations. In this paper, we show that adaptive stepsize control can be incorporated within a family of parallel time integrators known as Revisionist Integral Deferred Correction (RIDC) methods. The RIDC framework allows for various strategies to implement stepsize control, and we report results from exploring a few of them.Comment: revised paper (regeneration of graphics, typos, added embedded RK error estimators
- 27 March 2015
- Published by Mathematical Sciences Publishers in Communications in Applied Mathematics and Computational Science
- Vol. 10 (1) , 1-25
Revisionist integral deferred correction with adaptive step-size control
Adaptive stepsize control is a critical feature for the robust and efficient numerical solution of initial-value problems in ordinary differential equations. In this paper, we show that adaptive stepsize control can be incorporated within a family of parallel time integrators known as Revisionist Integral Deferred Correction (RIDC) methods. The RIDC framework allows for various strategies to implement stepsize control, and we report results from exploring a few of them.Comment: revised paper (regeneration of graphics, typos, added embedded RK error estimators
- 23 April 2014
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 83 (290) , 2763-2786
Method of lines transpose: An implicit solution to the wave equation
We present a new method for solving the wave equation implicitly in one spatial dimension. Our approach is to discretize the wave equation in time, following the method of lines transpose, sometimes referred to as the transverse method of lines, or Rothe’s method. We then solve the resulting system of partial differential equations using boundary integral methods. Our algorithm extends to higher spatial dimensions using an alternating direction implicit (ADI) framework. Thus we develop a boundary integral solution that is competitive with explicit finite difference methods, both in terms of accuracy and speed. However, it provides more flexibility in the treatment of source functions and complex boundaries. We provide the analytical details of our one-dimensional method herein, along with a proof of the convergence of our schemes in free space and on a bounded domain. We find that the method is unconditionally stable and achieves second order accuracy. Upon examining the discretization error, we derive a novel optimal quadrature method, which can be viewed as a Lax-type correction.
- 23 April 2014
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 83 (290) , 2763-2786
Method of lines transpose: An implicit solution to the wave equation
We present a new method for solving the wave equation implicitly in one spatial dimension. Our approach is to discretize the wave equation in time, following the method of lines transpose, sometimes referred to as the transverse method of lines, or Rothe’s method. We then solve the resulting system of partial differential equations using boundary integral methods. Our algorithm extends to higher spatial dimensions using an alternating direction implicit (ADI) framework. Thus we develop a boundary integral solution that is competitive with explicit finite difference methods, both in terms of accuracy and speed. However, it provides more flexibility in the treatment of source functions and complex boundaries. We provide the analytical details of our one-dimensional method herein, along with a proof of the convergence of our schemes in free space and on a bounded domain. We find that the method is unconditionally stable and achieves second order accuracy. Upon examining the discretization error, we derive a novel optimal quadrature method, which can be viewed as a Lax-type correction.
- Open Access
Arbitrarily high order Convected Scheme solution of the Vlasov-Poisson system
The Convected Scheme (CS) is a `forward-trajectory' semi-Lagrangian method for solution of transport equations, which has been most often applied to the kinetic description of plasmas and rarefied neutral gases. In its simplest form, the CS propagates the solution by advecting the `moving cells' along their characteristic trajectories, and by remapping them on the mesh at the end of the time step. The CS is conservative, positivity preserving, simple to implement, and not subject to time step restriction to maintain stability. Recently [Y. G\"u\c{c}l\"u and W.N.G. Hitchon, 2012] a new methodology was introduced for reducing numerical diffusion, based on a modified equation analysis: the remapping error was compensated by applying small corrections to the final position of the moving cells prior to remapping. While the spatial accuracy was increased from 2nd to 4th order, the new scheme retained the important properties of the original method, and was shown to be simple and efficient for constant advection problems. Here the CS is applied to the solution of the Vlasov-Poisson system: the Vlasov equation is split into two constant advection equations, one in configuration space and one in velocity space, and high order time accuracy is achieved by proper composition of the operators. The splitting procedure enables us to use the constant advection solver, which we extend to arbitrarily high order of accuracy: a new improved procedure is given, which makes the calculation of the corrections straightforward. Focusing on periodic domains, we describe a spectrally accurate scheme based on the fast Fourier transform; the proposed implementation is strictly conservative and positivity preserving. The ability to correctly reproduce the system dynamics, as well as resolving small-scale features in the solution, is shown in classical 1D-1V test cases, both in the linear and the non-linear regimes.
Open AccessArbitrarily high order Convected Scheme solution of the Vlasov-Poisson system
The Convected Scheme (CS) is a `forward-trajectory' semi-Lagrangian method for solution of transport equations, which has been most often applied to the kinetic description of plasmas and rarefied neutral gases. In its simplest form, the CS propagates the solution by advecting the `moving cells' along their characteristic trajectories, and by remapping them on the mesh at the end of the time step. The CS is conservative, positivity preserving, simple to implement, and not subject to time step restriction to maintain stability. Recently [Y. G\"u\c{c}l\"u and W.N.G. Hitchon, 2012] a new methodology was introduced for reducing numerical diffusion, based on a modified equation analysis: the remapping error was compensated by applying small corrections to the final position of the moving cells prior to remapping. While the spatial accuracy was increased from 2nd to 4th order, the new scheme retained the important properties of the original method, and was shown to be simple and efficient for constant advection problems. Here the CS is applied to the solution of the Vlasov-Poisson system: the Vlasov equation is split into two constant advection equations, one in configuration space and one in velocity space, and high order time accuracy is achieved by proper composition of the operators. The splitting procedure enables us to use the constant advection solver, which we extend to arbitrarily high order of accuracy: a new improved procedure is given, which makes the calculation of the corrections straightforward. Focusing on periodic domains, we describe a spectrally accurate scheme based on the fast Fourier transform; the proposed implementation is strictly conservative and positivity preserving. The ability to correctly reproduce the system dynamics, as well as resolving small-scale features in the solution, is shown in classical 1D-1V test cases, both in the linear and the non-linear regimes.
- Open Access
A Multiscale Sub-linear Time Fourier Algorithm for Noisy Data
We extend the recent sparse Fourier transform algorithm of (Lawlor, Christlieb, and Wang, 2013) to the noisy setting, in which a signal of bandwidth N is given as a superposition of k << N frequencies and additive noise. We present two such extensions, the second of which exhibits a novel form of error-correction in its frequency estimation not unlike that of the beta-encoders in analog-to-digital conversion (Daubechies et al, 2006). The algorithm runs in time O(k log(k) log(N/k)) on average, provided the noise is not overwhelming. The error-correction property allows the algorithm to outperform FFTW, a highly optimized software package for computing the full discrete Fourier transform, over a wide range of sparsity and noise values, and is to the best of our knowledge novel in the sparse Fourier transform context.
Open AccessA Multiscale Sub-linear Time Fourier Algorithm for Noisy Data
We extend the recent sparse Fourier transform algorithm of (Lawlor, Christlieb, and Wang, 2013) to the noisy setting, in which a signal of bandwidth N is given as a superposition of k << N frequencies and additive noise. We present two such extensions, the second of which exhibits a novel form of error-correction in its frequency estimation not unlike that of the beta-encoders in analog-to-digital conversion (Daubechies et al, 2006). The algorithm runs in time O(k log(k) log(N/k)) on average, provided the noise is not overwhelming. The error-correction property allows the algorithm to outperform FFTW, a highly optimized software package for computing the full discrete Fourier transform, over a wide range of sparsity and noise values, and is to the best of our knowledge novel in the sparse Fourier transform context.
- Open Access
Energy-conserving discontinuous Galerkin methods for the Vlasov-Ampère system
In this paper, we propose energy-conserving numerical schemes for the Vlasov-Amp\`{e}re (VA) systems. The VA system is a model used to describe the evolution of probability density function of charged particles under self consistent electric field in plasmas. It conserves many physical quantities, including the total energy which is comprised of the kinetic and electric energy. Unlike the total particle number conservation, the total energy conservation is challenging to achieve. For simulations in longer time ranges, negligence of this fact could cause unphysical results, such as plasma self heating or cooling. In this paper, we develop the first Eulerian solvers that can preserve fully discrete total energy conservation. The main components of our solvers include explicit or implicit energy-conserving temporal discretizations, an energy-conserving operator splitting for the VA equation and discontinuous Galerkin finite element methods for the spatial discretizations. We validate our schemes by rigorous derivations and benchmark numerical examples such as Landau damping, two-stream instability and bump-on-tail instability.
Open AccessEnergy-conserving discontinuous Galerkin methods for the Vlasov-Ampère system
In this paper, we propose energy-conserving numerical schemes for the Vlasov-Amp\`{e}re (VA) systems. The VA system is a model used to describe the evolution of probability density function of charged particles under self consistent electric field in plasmas. It conserves many physical quantities, including the total energy which is comprised of the kinetic and electric energy. Unlike the total particle number conservation, the total energy conservation is challenging to achieve. For simulations in longer time ranges, negligence of this fact could cause unphysical results, such as plasma self heating or cooling. In this paper, we develop the first Eulerian solvers that can preserve fully discrete total energy conservation. The main components of our solvers include explicit or implicit energy-conserving temporal discretizations, an energy-conserving operator splitting for the VA equation and discontinuous Galerkin finite element methods for the spatial discretizations. We validate our schemes by rigorous derivations and benchmark numerical examples such as Landau damping, two-stream instability and bump-on-tail instability.
- Open Access
Scandalously Parallelizable Mesh Generation
We propose a novel approach which employs random sampling to generate an accurate non-uniform mesh for numerically solving Partial Differential Equation Boundary Value Problems (PDE-BVP's). From a uniform probability distribution U over a 1D domain, we sample M discretizations of size N where M>>N. The statistical moments of the solutions to a given BVP on each of the M ultra-sparse meshes provide insight into identifying highly accurate non-uniform meshes. Essentially, we use the pointwise mean and variance of the coarse-grid solutions to construct a mapping Q(x) from uniformly to non-uniformly spaced mesh-points. The error convergence properties of the approximate solution to the PDE-BVP on the non-uniform mesh are superior to a uniform mesh for a certain class of BVP's. In particular, the method works well for BVP's with locally non-smooth solutions. We present a framework for studying the sampled sparse-mesh solutions and provide numerical evidence for the utility of this approach as applied to a set of example BVP's. We conclude with a discussion of how the near-perfect paralellizability of our approach suggests that these strategies have the potential for highly efficient utilization of massively parallel multi-core technologies such as General Purpose Graphics Processing Units (GPGPU's). We believe that the proposed algorithm is beyond embarrassingly parallel; implementing it on anything but a massively multi-core architecture would be scandalous.
Open AccessScandalously Parallelizable Mesh Generation
We propose a novel approach which employs random sampling to generate an accurate non-uniform mesh for numerically solving Partial Differential Equation Boundary Value Problems (PDE-BVP's). From a uniform probability distribution U over a 1D domain, we sample M discretizations of size N where M>>N. The statistical moments of the solutions to a given BVP on each of the M ultra-sparse meshes provide insight into identifying highly accurate non-uniform meshes. Essentially, we use the pointwise mean and variance of the coarse-grid solutions to construct a mapping Q(x) from uniformly to non-uniformly spaced mesh-points. The error convergence properties of the approximate solution to the PDE-BVP on the non-uniform mesh are superior to a uniform mesh for a certain class of BVP's. In particular, the method works well for BVP's with locally non-smooth solutions. We present a framework for studying the sampled sparse-mesh solutions and provide numerical evidence for the utility of this approach as applied to a set of example BVP's. We conclude with a discussion of how the near-perfect paralellizability of our approach suggests that these strategies have the potential for highly efficient utilization of massively parallel multi-core technologies such as General Purpose Graphics Processing Units (GPGPU's). We believe that the proposed algorithm is beyond embarrassingly parallel; implementing it on anything but a massively multi-core architecture would be scandalous.