2017
DOI: 10.1137/16m106474x
|View full text |Cite
|
Sign up to set email alerts
|

Overresolving in the Laplace Domain for Convolution Quadrature Methods

Abstract: Abstract. Convolution quadrature (CQ) methods have enjoyed tremendous interest in recent years as an efficient tool for solving timedomain wave problems in unbounded domains via boundary integral equation techniques. In this paper we consider CQ type formulations for the parallel space-time evaluation of multistep or stiffly accurate Runge-Kutta rules for the wave equation. In particular, we decouple the number of Laplace domain solves from the number of time steps. This allows to overresolve in the Laplace do… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(31 citation statements)
references
References 28 publications
0
31
0
Order By: Relevance
“…The characteristics of a particular implementation of the CQ algorithm is determined by the choice made for time-domain finite-difference discretization, the spectral character of the discrete frequency-domain solver used [15], and the methods utilized for numerical inversion of the Z-transform. Existing CQ approaches have primarily utilized the second-order-accurate BDF2 time discretization [10], but recent work [8] proposes the use of higher-order m-stage Runge-Kutta schemes.…”
Section: Previous Hybrid Methods: Cqmentioning
confidence: 99%
See 2 more Smart Citations
“…The characteristics of a particular implementation of the CQ algorithm is determined by the choice made for time-domain finite-difference discretization, the spectral character of the discrete frequency-domain solver used [15], and the methods utilized for numerical inversion of the Z-transform. Existing CQ approaches have primarily utilized the second-order-accurate BDF2 time discretization [10], but recent work [8] proposes the use of higher-order m-stage Runge-Kutta schemes.…”
Section: Previous Hybrid Methods: Cqmentioning
confidence: 99%
“…[45] and direct Fourier transform in time [47]. As mentioned in section 1, two hybrid time-domain methods (i.e., methods that rely on transformation of the time variable by means of Fourier or Laplace transforms) have previously been proposed, namely, the CQ method [7,8,9,10,11,15,45] and the direct Fourier transform method [47]. The CQ method employs a discrete convolution that is obtained as temporal finite-difference schemes are solved by transform methods.…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…We point out here that no scattering poles associated with (6) lie inside the contour for C ⊂ {z ∈ C : Im z ≥ 0}. (An interesting discussion on analytic and numerical issues arising due to the existence of scattering poles near the contour C utilized in the practical implementation of the convolution quadrature method can be found in reference [7]. )…”
Section: Convolution Quadrature Methodsmentioning
confidence: 99%
“…is the free space Green function for the Helmholtz equation with wavenumbers k j = k j (ζ) defined in (7), which in view of Remark 3.1 are assumed to satisfy Re k j > 0 and Im k j ≥ 0.…”
Section: Windowed Green Function Methodsmentioning
confidence: 99%