arXiv subjects

Jan S. Hesthaven

Publications and source records attributed to Jan S. Hesthaven.

45 records · Page 3Linked to original sources

arXiv2012

Numerical simulations with a first order BSSN formulation of Einstein's field equations

We present a new fully first order strongly hyperbolic representation of the BSSN formulation of Einstein's equations with optional constraint damping terms. We describe the characteristic fields of the system, discuss its hyperbolicity properties, and present two numerical implementations and simulations: one using finite differences, adaptive mesh refinement and in particular binary black holes, and another one using the discontinuous Galerkin method in spherical symmetry. The results of this paper constitute a first step in an effort to combine the robustness of BSSN evolutions with very high accuracy numerical techniques, such as spectral collocation multi-domain or discontinuous Galerkin methods.

gr-qc↗

arXiv2011

Reduced basis catalogs for gravitational wave templates

We introduce a reduced basis approach as a new paradigm for modeling, representing and searching for gravitational waves. We construct waveform catalogs for non-spinning compact binary coalescences, and we find that for accuracies of 99% and 99.999% the method generates a factor of about $10-10^5$ fewer templates than standard placement methods. The continuum of gravitational waves can be represented by a finite and comparatively compact basis. The method is robust under variations in the noise of detectors, implying that only a single catalog needs to be generated.

gr-qc↗

arXiv2011

Viscous Shock Capturing in a Time-Explicit Discontinuous Galerkin Method

We present a novel, cell-local shock detector for use with discontinuous Galerkin (DG) methods. The output of this detector is a reliably scaled, element-wise smoothness estimate which is suited as a control input to a shock capture mechanism. Using an artificial viscosity in the latter role, we obtain a DG scheme for the numerical solution of nonlinear systems of conservation laws. Building on work by Persson and Peraire, we thoroughly justify the detector's design and analyze its performance on a number of benchmark problems. We further explain the scaling and smoothing steps necessary to turn the output of the detector into a local, artificial viscosity. We close by providing an extensive array of numerical tests of the detector in use.

math.NA↗

arXiv2010

Discontinuous Galerkin method for the spherically reduced BSSN system with second-order operators

We present a high-order accurate discontinuous Galerkin method for evolving the spherically-reduced Baumgarte-Shapiro-Shibata-Nakamura (BSSN) system expressed in terms of second-order spatial operators. Our multi-domain method achieves global spectral accuracy and long-time stability on short computational domains. We discuss in detail both our scheme for the BSSN system and its implementation. After a theoretical and computational verification of the proposed scheme, we conclude with a brief discussion of issues likely to arise when one considers the full BSSN system.

gr-qc↗

arXiv2010

Persistent junk solutions in time-domain modeling of extreme mass ratio binaries

In the context of metric perturbation theory for non-spinning black holes, extreme mass ratio binary (EMRB) systems are described by distributionally forced master wave equations. Numerical solution of a master wave equation as an initial boundary value problem requires initial data. However, because the correct initial data for generic-orbit systems is unknown, specification of trivial initial data is a common choice, despite being inconsistent and resulting in a solution which is initially discontinuous in time. As is well known, this choice leads to a "burst" of junk radiation which eventually propagates off the computational domain. We observe another unintended consequence of trivial initial data: development of a persistent spurious solution, here referred to as the Jost junk solution, which contaminates the physical solution for long times. This work studies the influence of both types of junk on metric perturbations, waveforms, and self-force measurements, and it demonstrates that smooth modified source terms mollify the Jost solution and reduce junk radiation. Our concluding section discusses the applicability of these observations to other numerical schemes and techniques used to solve distributionally forced master wave equations.

gr-qc↗

arXiv2009

Discontinuous Galerkin method for computing gravitational waveforms from extreme mass ratio binaries

Gravitational wave emission from extreme mass ratio binaries (EMRBs) should be detectable by the joint NASA-ESA LISA project, spurring interest in analytical and numerical methods for investigating EMRBs. We describe a discontinuous Galerkin (dG) method for solving the distributionally forced 1+1 wave equations which arise when modeling EMRBs via the perturbation theory of Schwarzschild blackholes. Despite the presence of jump discontinuities in the relevant polar and axial gravitational "master functions", our dG method achieves global spectral accuracy, provided that we know the instantaneous position, velocity, and acceleration of the small particle. Here these variables are known, since we assume that the particle follows a timelike geodesic of the Schwarzschild geometry. We document the results of several numerical experiments testing our method, and in our concluding section discuss the possible inclusion of gravitational self-force effects.

gr-qc↗

arXiv2009

IMEX evolution of scalar fields on curved backgrounds

Inspiral of binary black holes occurs over a time-scale of many orbits, far longer than the dynamical time-scale of the individual black holes. Explicit evolutions of a binary system therefore require excessively many time steps to capture interesting dynamics. We present a strategy to overcome the Courant-Friedrichs-Lewy condition in such evolutions, one relying on modern implicit-explicit ODE solvers and multidomain spectral methods for elliptic equations. Our analysis considers the model problem of a forced scalar field propagating on a generic curved background. Nevertheless, we encounter and address a number of issues pertinent to the binary black hole problem in full general relativity. Specializing to the Schwarzschild geometry in Kerr-Schild coordinates, we document the results of several numerical experiments testing our strategy.

gr-qc↗

arXiv2009

A generalization of the Wiener rational basis functions on infinite intervals

We formulate and derive a generalization of an orthogonal rational-function basis for spectral expansions over the infinite or semi-infinite interval. The original functions, first presented by Wiener are a mapping and weighting of the Fourier basis to the infinite interval. By identifying the Fourier series as a biorthogonal composition of Jacobi polynomials/functions, we are able to define generalized Fourier series' which, appropriately mapped to the whole real line and weighted, form a generalization of Wiener's basis functions. It is known that the original Wiener rational functions inherit sparse Galerkin matrices for differentiation, and can utilize the fast Fourier transform (FFT) for computation of the modal coefficients. We show that the generalized basis sets also have a sparse differentiation matrix and we discuss connection problems, which are necessary theoretical developments for application of the FFT.

math.NA↗

arXiv2009

Nodal Discontinuous Galerkin Methods on Graphics Processors

Discontinuous Galerkin (DG) methods for the numerical solution of partial differential equations have enjoyed considerable success because they are both flexible and robust: They allow arbitrary unstructured geometries and easy control of accuracy without compromising simulation stability. Lately, another property of DG has been growing in importance: The majority of a DG operator is applied in an element-local way, with weak penalty-based element-to-element coupling. The resulting locality in memory access is one of the factors that enables DG to run on off-the-shelf, massively parallel graphics processors (GPUs). In addition, DG's high-order nature lets it require fewer data points per represented wavelength and hence fewer memory accesses, in exchange for higher arithmetic intensity. Both of these factors work significantly in favor of a GPU implementation of DG. Using a single US$400 Nvidia GTX 280 GPU, we accelerate a solver for Maxwell's equations on a general 3D unstructured grid by a factor of 40 to 60 relative to a serial computation on a current-generation CPU. In many cases, our algorithms exhibit full use of the device's available memory bandwidth. Example computations achieve and surpass 200 gigaflops/s of net application-level floating point work. In this article, we describe and derive the techniques used to reach this level of performance. In addition, we present comprehensive data on the accuracy and runtime behavior of the method.

math.NA↗