260 research outputs found
Fast and Accurate Computation of Time-Domain Acoustic Scattering Problems with Exact Nonreflecting Boundary Conditions
This paper is concerned with fast and accurate computation of exterior wave
equations truncated via exact circular or spherical nonreflecting boundary
conditions (NRBCs, which are known to be nonlocal in both time and space). We
first derive analytic expressions for the underlying convolution kernels, which
allow for a rapid and accurate evaluation of the convolution with
operations over successive time steps. To handle the onlocality in space,
we introduce the notion of boundary perturbation, which enables us to handle
general bounded scatters by solving a sequence of wave equations in a regular
domain. We propose an efficient spectral-Galerkin solver with Newmark's time
integration for the truncated wave equation in the regular domain. We also
provide ample numerical results to show high-order accuracy of NRBCs and
efficiency of the proposed scheme.Comment: 22 pages with 9 figure
Analytic structure of radiation boundary kernels for blackhole perturbations
Exact outer boundary conditions for gravitational perturbations of the
Schwarzschild metric feature integral convolution between a time-domain
boundary kernel and each radiative mode of the perturbation. For both axial
(Regge-Wheeler) and polar (Zerilli) perturbations, we study the Laplace
transform of such kernels as an analytic function of (dimensionless) Laplace
frequency. We present numerical evidence indicating that each such
frequency-domain boundary kernel admits a "sum-of-poles" representation. Our
work has been inspired by Alpert, Greengard, and Hagstrom's analysis of
nonreflecting boundary conditions for the ordinary scalar wave equation.Comment: revtex4, 14 pages, 12 figures, 3 table
Efficient sum-of-exponentials approximations for the heat kernel and their applications
In this paper, we show that efficient separated sum-of-exponentials
approximations can be constructed for the heat kernel in any dimension. In one
space dimension, the heat kernel admits an approximation involving a number of
terms that is of the order for any x\in\bbR and
, where is the desired precision. In all
higher dimensions, the corresponding heat kernel admits an approximation
involving only terms for fixed accuracy
. These approximations can be used to accelerate integral
equation-based methods for boundary value problems governed by the heat
equation in complex geometry. The resulting algorithms are nearly optimal. For
points in the spatial discretization and time steps, the cost is
in terms of both memory and CPU time for
fixed accuracy . The algorithms can be parallelized in a
straightforward manner. Several numerical examples are presented to illustrate
the accuracy and stability of these approximations.Comment: 23 pages, 5 figures, 3 table
A bootstrap method for sum-of-poles approximations
A bootstrap method is presented for finding efficient sum-of-poles approximations of causal functions. The method is based on a recursive application of the nonlinear least squares optimization scheme developed in (Alpert et al. in SIAM J. Numer. Anal. 37:1138–1164, 2000), followed by the balanced truncation method for model reduction in computational control theory as a final optimization step. The method is expected to be useful for a fairly large class of causal functions encountered in engineering and applied physics. The performance of the method and its application to computational physics are illustrated via several numerical examples
- …