2014
DOI: 10.48550/arxiv.1407.0345
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Convolution Quadrature for Wave Simulations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2015
2015
2016
2016

Publication Types

Select...
5

Relationship

5
0

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 0 publications
0
10
0
Order By: Relevance
“…An underlying ODE solver is used to carry out the time discretization, which can be any A-stable linear multistep method or an implicit Runge-Kutta method. For a comprehensive introduction to the algorithmic aspects of CQ, see [11,18]. We present here a simple example to demonstrate the method.…”
Section: Full Discretizationmentioning
confidence: 99%
“…An underlying ODE solver is used to carry out the time discretization, which can be any A-stable linear multistep method or an implicit Runge-Kutta method. For a comprehensive introduction to the algorithmic aspects of CQ, see [11,18]. We present here a simple example to demonstrate the method.…”
Section: Full Discretizationmentioning
confidence: 99%
“…For theoretical aspects of multistep CQ methods applied to wave propagation, the reader is referred to [18,16,24]. Practical aspects on the implementation of CQ can be found in [4,5,14]. A concise explanation on how to use CQ for an acoustic wave propagation problem discretized with a method that is similar to the one in this paper is given in [10].…”
Section: Experiments In the Time Domainmentioning
confidence: 99%
“…A modern introduction to computational uses of CQ for wave propagation problems is given in [8]. Algorithmic details and several possible interpretations of CQ can be found in [18]. In this section we will follow the plan developed in [26,Section 10.3], based on [5, Section 6].…”
Section: Long Term Analysis In Free Spacementioning
confidence: 99%
“…For time-stepping we have used a simple BDF2-based Convolution Quadrature method: the analysis for the trapezoidal rule discretization follows very similar arguments and can be easily adapted from what appears in Section 6 of this work and [5, Section 6]. Higher order much less dispersive discretizations are easily attainable using RK-based CQ methods [4,7,8,18]. In that case the analysis relies entirely on Laplace domain estimates and the behavior of the bounds with respect to the time variable is still unclear.…”
Section: Introductionmentioning
confidence: 99%