DeepAI AI Chat
Log In Sign Up

Fast Computation of Electromagnetic Wave Propagation and Scattering for Quasi-cylindrical Geometry

by   Shaolin Liao, et al.

The cylindrical Taylor Interpolation through FFT (TI-FFT) algorithm for computation of the near-field and far-field in the quasi-cylindrical geometry has been introduced. The modal expansion coefficient of the vector potentials F and A within the context of the cylindrical harmonics (TE and TM modes) can be expressed in the closed-form expression through the cylindrical addition theorem. For the quasi-cylindrical geometry, the modal expansion coefficient can be evaluated through FFT with the help of the Taylor Interpolation (TI) technique. The near-field on any arbitrary cylindrical surface can be obtained through the Inverse Fourier Transform (IFT). The far-field can be obtained through the Near-Field Far-Field (NF-FF) transform. The cylindrical TI-FFT algorithm has the advantages of 𝒪( Nlog_2 N) computational complexity for N = N_ϕ×N_z computational grid, small sampling rate (large sampling spacing) and no singularity problem.


Sampling type method combined with deep learning for inverse scattering with one incident wave

We consider the inverse problem of determining the geometry of penetrabl...

A numerical reconstruction algorithm for the inverse scattering problem with backscatter data

This paper is concerned with the inverse scattering problem which aims t...

High Accuracy Quasi-Interpolation using a new class of generalized Multiquadrics

A new generalization of multiquadric functions ϕ(x)=√(c^2d+||x||^2d), wh...

Accelerating potential evaluation over unstructured meshes in two dimensions

The accurate and efficient evaluation of potentials is of great importan...

Efficient Interpolation-Based Decoding of Reed-Solomon Codes

We propose a new interpolation-based error decoding algorithm for (n,k) ...

A Fast Multipole Method for axisymmetric domains

The Fast Multipole Method (FMM) for the Poisson equation is extended to ...