On the Lagrange interpolation in multilevel fast multipole algorithm

Download

index.pdf

Date

2006-07-14

Author

Ergül, Özgür Salih

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

197
views

0
downloads

In this paper the Lagrange interpolation employed in the multilevel fast multipole algorithm (MLFMA) is considered as part of the efforts to obtain faster and more efficient solutions for large problems of computational electromagnetics. For the translation operator, this paper presents the choice of the parameters for optimal interpolation. Also, for the aggregation and disaggregation processes, the interpolation matrices are discussed and an efficient way of improving the accuracy by employing the poles are introduced

Subject Keywords

Lagrangian functions, Interpolation, MLFMA, Computational electromagnetics, Sampling methods, Polynomials, Councils, Contracts

URI

https://hdl.handle.net/11511/40955

DOI

https://doi.org/10.1109/aps.2006.1710941

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Investigation of nanoantennas using surface integral equations and the multilevel fast multipole algorithm Karaosmanoglu, Barıscan; Gur, Ugur Merıc; Ergül, Özgür Salih (2015-07-09) A rigorous analysis of nanoantennas using surface integral equations and the multilevel fast multipole algorithm (MLFMA) is presented. Plasmonic properties of materials at optical frequencies are considered by using the Lorentz-Drude models and employing surface formulations for penetrable objects. The electric and magnetic current combined-field integral equation is preferred for fast and accurate solutions, which are further accelerated by an MLFMA implementation that is modified for plasmonic structures....
Fast Algorithms for Digital Computation of Linear Canonical Transforms Koc, Aykut; Öktem, Sevinç Figen; Ozaktas, Haldun M.; Kutay, M. Alper (2016-01-01) Fast and accurate algorithms for digital computation of linear canonical transforms (LCTs) are discussed. Direct numerical integration takes O.N-2/time, where N is the number of samples. Designing fast and accurate algorithms that take O. N logN/time is of importance for practical utilization of LCTs. There are several approaches to designing fast algorithms. One approach is to decompose an arbitrary LCT into blocks, all of which have fast implementations, thus obtaining an overall fast algorithm. Another a...
On the Poisson sum formula for analysis of EM radiation/scattering from large finite arrays Aydın Çivi, Hatice Özlem; Chou, HT (1998-01-01) A useful procedure, that has been described previously in the literature, employs the Poisson sum formula to represent the solution to the fields of a three-dimensional (3D) large periodically spaced finite planar array problem configuration as a convolution of the infinite planar periodic array solution and the Fourier transform of the equivalent aperture distribution over the finite array. It is shown here that the Poisson sum formula utilized by Felsen and Carin (see J. Opt. Soc. Am. A, vol.11, no.4, p.1...
Two-Step Lagrange Interpolation Method for the Multilevel Fast Multipole Algorithm Ergül, Özgür Salih; Gurel, L. (Institute of Electrical and Electronics Engineers (IEEE), 2009) We present a two-step Lagrange interpolation method for the efficient solution of large-scale electromagnetics problems with the multilevel fast multipole algorithm (MLFMA). Local interpolations are required during aggregation and disaggregation stages of MLFMA in order to match the different sampling rates for the radiated and incoming fields in consecutive levels. The conventional one-step method is decomposed into two one-dimensional interpolations, applied successively. As it provides a significant acce...
On Crank-Nicolson Adams-Bashforth timestepping for approximate deconvolution models in two dimensions Kaya Merdan, Songül; Rebholz, Leo G. (2014-11-01) We consider a Crank-Nicolson-Adams-Bashforth temporal discretization, together with a finite element spatial discretization, for efficiently computing solutions to approximate deconvolution models of incompressible flow in two dimensions. We prove a restriction on the timestep that will guarantee stability, and provide several numerical experiments that show the proposed method is very effective at finding accurate coarse mesh approximations for benchmark flow problems.

Citation Formats

Ö. S. Ergül, “On the Lagrange interpolation in multilevel fast multipole algorithm,” 2006, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40955.