MCMatthew F. Causley

Matthew F. Causley

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Matthew F. Causley has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Method of lines transpose: An implicit solution to the wave equation

    by Matthew Causley, Andrew Christlieb, Benjamin Ong, Lee Van Groningen

    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

    Higher order A-stable schemes for the wave equation using a recursive convolution approach

    by Matthew F. Causley, Andrew J. Christlieb

    In several recent works \cite{Causley2013a}, \cite{Causley2013}, we developed a new second order, A-stable approach to wave propagation problems based on the method of lines transpose (MOL$^T$) formulation combined with alternating direction implicit (ADI) schemes. In this work, we present several important modifications to our work, and thus obtain a family of wave solvers which are unconditionally stable, accurate of order 2P, and require $O(P^d N)$ operations per time step, where $N$ is the number of spatial points, and $d$ the number of spatial dimensions. We obtain these schemes by including higher derivatives of the solution, rather than increasing the number of time levels. The novel aspect of our approach is that the higher derivatives are constructed using successive applications of the convolution operator. We develop these schemes in one spatial dimension, and then extend the results to higher dimensions, by reformulating the ADI scheme to include recursive convolution. Thus, we retain a fast, unconditionally stable scheme, which does not suffer from the large dispersion errors characteristic to the ADI method. We demonstrate the utility of the method by applying it to a host of wave propagation problems. This method holds great promise for developing higher order, parallelizable algorithms for solving hyperbolic PDEs, and can also be extended to parabolic PDEs.

  • Open Access

    Method of Lines Transpose: A Fast Implicit Wave Propagator

    by Matthew F. Causley, Andrew J. Christlieb, Yaman Guclu, Eric Wolf

    As a follow up to \cite{Causley2013}, we provide a detailed description of the numerical implementation of an O(N), A-stable, second order accurate solution of the wave equation, constructed from semi-discrete boundary value problems. We improve on the previous algorithm by replacing the Lax-type correction used in \cite{Causley2013}, which was necessary for convergence when $\Delta t < \Delta x/c$, with a more accurate spatial quadrature, which we prove is convergent. We also demonstrate that the resulting solver remains fast even in the case of unstructured meshes, can incorporate domain decomposition, and allows for the implementation of Dirichlet, Neumann, periodic and outflow boundary conditions. Building upon results for the 1d formulation, we utilize alternate direction implicit (ADI) splitting to achieve a fast O(N) solver in higher spatial dimensions. Our solver is built upon line objects and, combined with the flexibility of the integral solver, allows us to solve problems on arbitrary spatial domains, by embedding the boundary in a regular Cartesian mesh. Our solver is designed to couple with particle codes, where scale separation is an issue. We therefore demonstrate the ability of our solver to take time steps well beyond that of the Courant-Friedrichs-Lewy (CFL) stability limit of explicit codes.