On the numerical approximation of high-frequency acoustic multiple scattering problems by circular cylinders

Authors:
Xavier Antoine;Chokri Chniti;Karim Ramdani
Affiliations:
Institut National Polytechnique de Lorraine (INPL), Nancy Université, Ecole Nationale Supérieure des Mines de Nancy, Département de Génie Industriel, Parc de Saurupt, CS 14 234 ...;INRIA (CORIDA Team) and Institut Elie Cartan Nancy (IECN), Nancy-Université, Université Henri Poincaré, B.P. 239, F-54506 Vandoeuvre-lès-Nancy Cedex, France;INRIA (CORIDA Team) and Institut Elie Cartan Nancy (IECN), Nancy-Université, Université Henri Poincaré, B.P. 239, F-54506 Vandoeuvre-lès-Nancy Cedex, France
Venue:
Journal of Computational Physics
Year:
2008

Citing 3
Cited 3

Fast and Efficient Algorithms in Computational Electromagnetics

Fast and Efficient Algorithms in Computational Electromagnetics
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
Dirichlet-to-Neumann boundary conditions for multiple scattering problems

Journal of Computational Physics

Coupling of Dirichlet-to-Neumann boundary condition and finite difference methods in curvilinear coordinates for multiple scattering

Journal of Computational Physics
A Trefftz-based numerical modelling framework for Helmholtz problems with complex multiple-scatterer configurations

Journal of Computational Physics
Spectral and condition number estimates of the acoustic single-layer operator for low-frequency multiple scattering in dense media

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	31.46

Visualization

Abstract

The aim of this paper is to propose a numerical strategy for computing the solution of two-dimensional time-harmonic acoustic multiple scattering problems at high-frequency. The scatterers are assumed to be circular, leading therefore to semi-analytical representation formulae of the scattered field through the solution of a large linear system of equations. Taking advantage of the special block Toeplitz structure of the matrix of the linear system, a fast iterative and preconditioned numerical method yielding large memory savings is proposed. Several numerical experiments for general configurations are presented to show the efficiency of the numerical method.