2014
DOI: 10.1016/j.jcp.2014.08.047
|View full text |Cite
|
Sign up to set email alerts
|

A high order spectral algorithm for elastic obstacle scattering in three dimensions

Abstract: To cite this version:Frédérique Le Louër. A high order spectral algorithm for elastic obstacle scattering in three dimensions. Journal of Computational Physics, Elsevier, 2014, 279, pp.1-17. A high order spectral algorithm for elastic obstacle scattering in three dimensionsFrédérique Le Louër AbstractIn this paper we describe a high order spectral algorithm for solving the time-harmonic Navier equations in the exterior of a bounded obstacle in three space dimensions, with Dirichlet or Neuma… 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

2014
2014
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 32 publications
(32 citation statements)
references
References 23 publications
(36 reference statements)
0
31
0
Order By: Relevance
“…The numerical implementation is briefly described in Section 4 and numerical results on the convergence rate of the method are presented for smooth and non smooth obstacles. The mathematical analysis renders even possible the implementation of hypersingular kernels [37,38]. However, in the extreme low-frequency regime, as ω → 0, numerical methods that use only tangential basis functions are not sufficient to avoid the low-frequency breakdown [19].…”
Section: E4mentioning
confidence: 99%
“…The numerical implementation is briefly described in Section 4 and numerical results on the convergence rate of the method are presented for smooth and non smooth obstacles. The mathematical analysis renders even possible the implementation of hypersingular kernels [37,38]. However, in the extreme low-frequency regime, as ω → 0, numerical methods that use only tangential basis functions are not sufficient to avoid the low-frequency breakdown [19].…”
Section: E4mentioning
confidence: 99%
“…The principal part of 2μDMathClass-rel′scriptM is 2μP0(DMathClass-rel′)scriptMP. To recover the principal parts of the other terms in the operator N , we consider the following form for the operator T x . bold-italicTnormalx MathClass-rel= 2μscriptMnormalx MathClass-bin+ (λMathClass-bin+ 2μ)bold-italicn(bold-italicx)divnormalx MathClass-bin−μbold-italicn(bold-italicx) MathClass-bin×boldcurlnormalxMathClass-punc. We have to apply T x to these two terms t1 MathClass-rel= MathClass-bin−MathClass-op∫Γ[bold-italicn(bold-italicy) MathClass-bin×boldcurlnormaly{G(κsMathClass-punc,bold-italicx MathClass-bin−bold-italicy)normalI3}]normalTbold-italicψ(bold-italicy)ds(bold-italicy)MathClass-punc, t2 MathClass-rel= MathClass-bin−MathClass-op∫ΓxG(κpMathClass-punc,bold-italicx MathClass-bin−bold-italicy) ()bold-italicn(bold-italicy…”
Section: Preconditioned Brakhage–werner Type Integral Equationsmentioning
confidence: 99%
“…We consider integral representations of the operators D and D 0 obtained in [32] .D /. By composition, the principal part of the aforementioned expression is i 2 n C Ä 2 s I 1 2 div I t .…”
Section: Proofmentioning
confidence: 99%
See 1 more Smart Citation
“…To effectively reduce the BIE into a linear system, many different solvers including the boundary element method (BEM) ( [13]), the Nyströme method ( [16]), the fast multipole method [5,17] and the spectral method ( [12]) have been considered.…”
Section: Introductionmentioning
confidence: 99%