Search arXivSearch

arXiv · 1602.04691

A Fast Algorithm for Solving Scalar Wave Scattering Problem by Billions of Particles

Abstract

Scalar wave scattering by many small particles of arbitrary shapes with impedance boundary condition is studied. The problem is solved asymptotically and numerically under the assumptions a << d << lambda, where k = 2pi/lambda is the wave number, lambda is the wave length, a is the characteristic size of the particles, and d is the smallest distance between neighboring particles. A fast algorithm for solving this wave scattering problem by billions of particles is presented. The algorithm comprises the derivation of the (ORI) linear system and makes use of Conjugate Orthogonal Conjugate Gradient method and Fast Fourier Transform. Numerical solutions of the scalar wave scattering problem with 1, 4, 7, and 10 billions of small impedance particles are achieved for the first time. In these numerical examples, the problem of creating a material with negative refraction coefficient is also described and a recipe for creating materials with a desired refraction coefficient is tested.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander Ramm, Nhan Tran. 2016-02-15. A Fast Algorithm for Solving Scalar Wave Scattering Problem by Billions of Particles. https://arxiv.org/abs/1602.04691

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA