2019
DOI: 10.1016/j.cma.2019.07.018
|View full text |Cite
|
Sign up to set email alerts
|

hp-version time domain boundary elements for the wave equation on quasi-uniform meshes

Abstract: Solutions to the wave equation in the exterior of a polyhedral domain or a screen in R 3 exhibit singular behavior from the edges and corners. We present quasi-optimal hp-explicit estimates for the approximation of the Dirichlet and Neumann traces of these solutions for uniform time steps and (globally) quasi-uniform meshes on the boundary. The results are applied to an hp-version of the time domain boundary element method. Numerical examples confirm the theoretical results for the Dirichlet problem both for s… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

4
3

Authors

Journals

citations
Cited by 12 publications
(19 citation statements)
references
References 49 publications
(150 reference statements)
0
17
0
Order By: Relevance
“…The error of the approximate solutions obtained from the preconditioner as an independent solver turns out to be small compared to the discretization error, and it decreases as the mesh size h tends to 0, provided the CFL ratio h ∆t is fixed. However, the rigorous numerical analysis of the surprisingly good stability properties remains open, while higher-order extrapolation for ansatz and test functions of higher polynomial degree is the content of current work [12]. For the non-polynomial basis functions of a partition of unity method with a large time step the preconditioner may still reduce the number of necessary GMRES iterations.…”
Section: Discussionmentioning
confidence: 99%
“…The error of the approximate solutions obtained from the preconditioner as an independent solver turns out to be small compared to the discretization error, and it decreases as the mesh size h tends to 0, provided the CFL ratio h ∆t is fixed. However, the rigorous numerical analysis of the surprisingly good stability properties remains open, while higher-order extrapolation for ansatz and test functions of higher polynomial degree is the content of current work [12]. For the non-polynomial basis functions of a partition of unity method with a large time step the preconditioner may still reduce the number of necessary GMRES iterations.…”
Section: Discussionmentioning
confidence: 99%
“…In the second step, we apply the MACA from Sect. 5 to each block of the partition and obtain low-rank factorisations of the form (26). Eventually, we end up with a hierarchical tensor approximation, which reads…”
Section: Combined Algorithmmentioning
confidence: 99%
“…To this end, the latter is partitioned either into a tensor grid or into an unstructured grid made of tetrahedral finite elements [41]. For that reason, space-time methods feature an inherent flexibility, including adaptive refinement in both time and space simultaneously as well as the ability to capture moving geometries [25,26,55]. However, the computational costs are high due to the increase in dimensionality and the calculation of the retarded potentials is far from trivial [56].…”
Section: Introductionmentioning
confidence: 99%
“…We now consider the discretization of the single layer potential. For the ansatz function we choose (16) and as test function we choose (18).…”
Section: Appendix B Discretization and Mot-algorithmmentioning
confidence: 99%