1,152 research outputs found
Local discontinuous Galerkin methods for fractional ordinary differential equations
This paper discusses the upwinded local discontinuous Galerkin methods for
the one-term/multi-term fractional ordinary differential equations (FODEs). The
natural upwind choice of the numerical fluxes for the initial value problem for
FODEs ensures stability of the methods. The solution can be computed element by
element with optimal order of convergence in the norm and
superconvergence of order at the downwind point of each
element. Here is the degree of the approximation polynomial used in an
element and () represents the order of the one-term
FODEs. A generalization of this includes problems with classic 'th-term
FODEs, yielding superconvergence order at downwind point as
. The underlying mechanism of the
superconvergence is discussed and the analysis confirmed through examples,
including a discussion of how to use the scheme as an efficient way to evaluate
the generalized Mittag-Leffler function and solutions to more generalized
FODE's.Comment: 17 pages, 7 figure
Structure-Preserving Model-Reduction of Dissipative Hamiltonian Systems
Reduced basis methods are popular for approximately solving large and complex
systems of differential equations. However, conventional reduced basis methods
do not generally preserve conservation laws and symmetries of the full order
model. Here, we present an approach for reduced model construction, that
preserves the symplectic symmetry of dissipative Hamiltonian systems. The
method constructs a closed reduced Hamiltonian system by coupling the full
model with a canonical heat bath. This allows the reduced system to be
integrated with a symplectic integrator, resulting in a correct dissipation of
energy, preservation of the total energy and, ultimately, in the stability of
the solution. Accuracy and stability of the method are illustrated through the
numerical simulation of the dissipative wave equation and a port-Hamiltonian
model of an electric circuit
Structure Preserving Model Reduction of Parametric Hamiltonian Systems
While reduced-order models (ROMs) have been popular for efficiently solving
large systems of differential equations, the stability of reduced models over
long-time integration is of present challenges. We present a greedy approach
for ROM generation of parametric Hamiltonian systems that captures the
symplectic structure of Hamiltonian systems to ensure stability of the reduced
model. Through the greedy selection of basis vectors, two new vectors are added
at each iteration to the linear vector space to increase the accuracy of the
reduced basis. We use the error in the Hamiltonian due to model reduction as an
error indicator to search the parameter space and identify the next best basis
vectors. Under natural assumptions on the set of all solutions of the
Hamiltonian system under variation of the parameters, we show that the greedy
algorithm converges with exponential rate. Moreover, we demonstrate that
combining the greedy basis with the discrete empirical interpolation method
also preserves the symplectic structure. This enables the reduction of the
computational cost for nonlinear Hamiltonian systems. The efficiency, accuracy,
and stability of this model reduction technique is illustrated through
simulations of the parametric wave equation and the parametric Schrodinger
equation
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.Comment: 28 pages, uses revtex4. Revised in response to referee's report. One
numerical experiment added which incorporates perturbed initial data and
adaptive time-steppin
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.Comment: 33 pages, 12 figures, 4 table
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.Comment: 35 pages, 6 figures, 1 table, uses revtex4. Revised in response to
referee's repor
Deep convolutional neural networks for estimating porous material parameters with ultrasound tomography
We study the feasibility of data based machine learning applied to ultrasound
tomography to estimate water-saturated porous material parameters. In this
work, the data to train the neural networks is simulated by solving wave
propagation in coupled poroviscoelastic-viscoelastic-acoustic media. As the
forward model, we consider a high-order discontinuous Galerkin method while
deep convolutional neural networks are used to solve the parameter estimation
problem. In the numerical experiment, we estimate the material porosity and
tortuosity while the remaining parameters which are of less interest are
successfully marginalized in the neural networks-based inversion. Computational
examples confirms the feasibility and accuracy of this approach
Fast prediction and evaluation of gravitational waveforms using surrogate models
[Abridged] We propose a solution to the problem of quickly and accurately
predicting gravitational waveforms within any given physical model. The method
is relevant for both real-time applications and in more traditional scenarios
where the generation of waveforms using standard methods can be prohibitively
expensive. Our approach is based on three offline steps resulting in an
accurate reduced-order model that can be used as a surrogate for the
true/fiducial waveform family. First, a set of m parameter values is determined
using a greedy algorithm from which a reduced basis representation is
constructed. Second, these m parameters induce the selection of m time values
for interpolating a waveform time series using an empirical interpolant. Third,
a fit in the parameter dimension is performed for the waveform's value at each
of these m times. The cost of predicting L waveform time samples for a generic
parameter choice is of order m L + m c_f online operations where c_f denotes
the fitting function operation count and, typically, m << L. We generate
accurate surrogate models for Effective One Body (EOB) waveforms of
non-spinning binary black hole coalescences with durations as long as 10^5 M,
mass ratios from 1 to 10, and for multiple harmonic modes. We find that these
surrogates are three orders of magnitude faster to evaluate as compared to the
cost of generating EOB waveforms in standard ways. Surrogate model building for
other waveform models follow the same steps and have the same low online
scaling cost. For expensive numerical simulations of binary black hole
coalescences we thus anticipate large speedups in generating new waveforms with
a surrogate. As waveform generation is one of the dominant costs in parameter
estimation algorithms and parameter space exploration, surrogate models offer a
new and practical way to dramatically accelerate such studies without impacting
accuracy.Comment: 20 pages, 17 figures, uses revtex 4.1. Version 2 includes new
numerical experiments for longer waveform durations, larger regions of
parameter space and multi-mode model
- …