Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-23T11:15:55.706Z Has data issue: false hasContentIssue false

7 - Boundary integral methods in high frequency scattering

Published online by Cambridge University Press:  07 September 2011

S.N. Chandler-Wilde
Affiliation:
University of Reading
I.G. Graham
Affiliation:
University of Bath
Bjorn Engquist
Affiliation:
University of Texas, Austin
Athanasios Fokas
Affiliation:
University of Cambridge
Ernst Hairer
Affiliation:
Université de Genève
Arieh Iserles
Affiliation:
University of Cambridge
Get access

Summary

Abstract

In this article we review recent progress on the design, analysis and implementation of numerical-asymptotic boundary integral methods for the computation of frequency-domain acoustic scattering in a homogeneous unbounded medium by a bounded obstacle. The main aim of the methods is to allow computation of scattering at arbitrarily high frequency with finite computational resources.

Introduction

There is huge mathematical and engineering interest in acoustic and electromagnetic wave scattering problems, driven by many applications such as modelling radar, sonar, acoustic noise barriers, atmospheric particle scattering, ultrasound and VLSI. For time harmonic problems in infinite domains and media which are predominantly homogeneous, the boundary element method is a very popular solver, used in a number of large commercial codes, see e.g. [CSCVHH04]. In many practical applications the characteristic length scale L of the domain is large compared to the wavelength λ. Then the small dimensionless wavelength λ/L induces oscillatory solutions, and the application of conventional (piece-wise polynomial) boundary elements for this multiscale problem yields full matrices of dimension at least N = (L/λ)d-1 (in ℝd). (Domain finite elements lead to sparse matrices but require even larger N.) Since this “loss of robustness” as L/λ→∞ puts high frequency problems outside the reach of many standard algorithms, much recent research has been devoted to finding more robust methods.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×