𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast directional algorithm for high-frequency electromagnetic scattering

✍ Scribed by Paul Tsuji; Lexing Ying

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
1002 KB
Volume
230
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

✦ Synopsis

This paper is concerned with the fast solution of high-frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional multilevel algorithm previously proposed for the acoustic scattering case to the vector electromagnetic case. We also detail how to incorporate the curl operator of the magnetic field integral equation into the algorithm. When combined with a standard iterative method, this results in an almost linear complexity solver for the combined field integral equations. In addition, the butterfly algorithm is utilized to compute the far field pattern and radar cross section with O(N log N) complexity.

📜 SIMILAR VOLUMES

Fast directional multilevel algorithm co
Fast directional multilevel algorithm combined with Calderon multiplicative preconditioner for stable electromagnetic scattering analysis
✍ H. Chen; J. Zhu; R. S. Chen; Z.H. Fan 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 359 KB

## Abstract In this article, a new method called fast directional multilevel algorithm (FDMA) is proposed for three‐dimensional electromagnetic problems. Combined with the Caldron identities of Calderon multiplicative preconditioner (CMP), the new algorithm has a fast convergence rate of iterative

On the multiplaten Z-buffer algorithm fo
On the multiplaten Z-buffer algorithm for ray tracing in high-frequency electromagnetic scattering computations
✍ Yong Zhou; Hao Ling 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

## Abstract A ray tracer based on the multiplaten Z‐buffer (MPZ) algorithm is implemented and its performance is evaluated against the binary space‐partition tree algorithm. Our results indicate that the computational complexity of the MPZ is independent of the number of facets, thus making it pote

A fast, high-order quadrature sampled pr
A fast, high-order quadrature sampled pre-corrected fast-Fourier transform for electromagnetic scattering
✍ Stephen Gedney; Aiming Zhu; Wee-Hua Tang; Gang Liu; Peter Petre 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

## Abstract In this paper, a novel fast, high‐order solution procedure referred to as the quadrature sampled pre‐corrected fast‐Fourier transform (QS‐PCFFT) is presented. The method accelerates far‐interaction terms of an integral operator using the discontinuous FFT 1, which combines Gaussian‐quad

Multilevel fast multipole algorithm enha
Multilevel fast multipole algorithm enhanced by GPU parallel technique for electromagnetic scattering problems
✍ Kan Xu; Da Zhi Ding; Zheng Hong Fan; Ru Shan Chen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB

## Abstract Along with the development of graphics processing Units (GPUS) in floating point operations and programmability, GPU has increasingly become an attractive alternative to the central processing unit (CPU) for some of compute‐intensive and parallel tasks.In this article, the multilevel fa

A Fast Algorithm for Adapted Time–Freque
A Fast Algorithm for Adapted Time–Frequency Tilings
✍ Christoph M. Thiele; Lars F. Villemoes 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We first consider orthonormal bases of R N consisting of discretized rescaled Walsh functions, where N is a power of two. Given a vector, the best basis with respect to an additive cost function is found with an algorithm of order O(N log N). The algorithm operates in the time-frequency plane by con