• Aucun résultat trouvé

DGTD methods using modal basis functions and symplectic local time-stepping: application to wave propagation problems

N/A
N/A
Protected

Academic year: 2021

Partager "DGTD methods using modal basis functions and symplectic local time-stepping: application to wave propagation problems"

Copied!
35
0
0

Texte intégral

Loading

Figure

Table 1: Condition numbers of the mass matrix for polynomials π α k (1D, 2D, and 3D).
Figure 2: Algorithm R 3 (∆t): the twenty-one sub-steps are detailed from 1 to 21.
Figure 3: Unstructured triangular mesh near the circular array.
Figure 4: Square inclusion: p/H z (top), u/E y (middle), and v/ − E x (bottom) near the inclusion, obtained with algorithm R 11 (2.6ms) at t = 4s (extremal values for contours on the zooms have been adapted).
+2

Références

Documents relatifs

For each set of acquisition parameter image noise was measured and the Rose model observer was used to test two strategies for proposing a reasonable compromise between dose and

When the thickness of this intermediate layer is much smaller than the size of the domain, the physical problem with continuously varying parameters can be approximated by the

The present paper deals with maximal Lp-regularity for non-autonomous evolution equations in the setting of Hilbert spaces. We consider another Hilbert space V which is densely

We compared several properties of the host galaxies in these two groups of objects like galaxy mass, color, concentration index, line widths, morphological type and

Application to stochastic high-amplitude wave propagation over urban environments using the Nonlinear Parabolic Equation model.. This chapter concerns the development of a

Localized adaptive radiation condition for coupling boundary with finite element methods applied to wave propagation problems.. A BDERRAHMANE B ENDALI †, University

Finite element approximation of Helmholtz problems with application to seismic wave propagation.. General

In most Navier-Stokes explicit and parallel solvers, a domain decomposition method is used to split the overall computational domain into several blocks (noted B j ).. Each block