𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Application of the fast multipole method to the generalized forward–backward iterative algorithm

✍ Scribed by M. R. Pino; F. Obelleiro; L. Landesa; R. J. Burkholder


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
155 KB
Volume
26
Category
Article
ISSN
0895-2477

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A Generalized One-Dimensional Fast Multi
✍ Norman Yarvin; Vladimir Rokhlin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 184 KB

The need to filter functions defined on the sphere arises in a number of applications, such as climate modeling, electromagnetic and acoustic scattering, and several other areas. Recently, it has been observed that the problem of uniform resolution filtering on the sphere can be performed efficientl

Application of the multipole theory meth
✍ Qinhong Zheng; Ming Song 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB 👁 1 views

## Abstract In this paper, the multipole theory (MT) method is presented as a new approach for determining the cutoff frequency and analyzing the propagation characteristics of finlines. The inhomogeneous field domain of finline is treated as a combination of several simple homogeneous regions, and

An iterative algorithm to extend the app
✍ F. Obelleiro; J. L. Rodríguez; L. Landesa; A. G. Pino 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 2 views

In this letter, an iterati¨e algorithm is presented in order to extend the applicability of the hybrid generalized-multipole-technique ( ) moment-method GMT᎐MoM approach to more complex electromagnetic problems in¨ol¨ing multiobject scatters. The proposed algorithm shows ¨ery fast con¨ergence, pro¨i

Guidelines for using the fast multipole
✍ Sunil S. Bindiganavale; John L. Volakis 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 501 KB

i n this article we consider the implementation of a version of the fast multipole method for scattering by large objects. We put particular emphasis on error and erecution time. I n contrast to the traditional moment method, the fast multiple method (FMM) has an O(N'3 CPU requirement per incidence