Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Optimal interpolation of translation operator in multilevel fast multipole algorithm
Download
index.pdf
Date
2006-12-01
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
87
views
0
downloads
Cite This
Lagrange interpolation of the translation operator in the three-dimensional multilevel fast multipole algorithm (MLFMA) is revisited. Parameters of the interpolation, namely, the number of interpolation points and the oversampling factor, are optimized for controllable error. Via optimization, it becomes possible to obtain the desired level of accuracy with the minimum processing time.
Subject Keywords
Electrical and Electronic Engineering
URI
https://hdl.handle.net/11511/35737
Journal
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION
DOI
https://doi.org/10.1109/tap.2006.886562
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
Enhancing the accuracy of the interpolations and anterpolations in MLFMA
Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2006-01-01)
We present an efficient technique to reduce the interpolation and anterpolation (transpose interpolation) errors in the aggregation and disaggregation processes of the multilevel fast multipole algorithm (MLFMA), which is based on the sampling of the radiated and incoming fields over all possible solid angles, i.e., all directions on the sphere. The fields sampled on the sphere are subject to various operations, such as interpolation, aggregation, translation, disaggregation, anterpolation, and integration....
HMM topology for boundary refinement in automatic speech segmentation
Akdemir, E.; Çiloğlu, Tolga (Institution of Engineering and Technology (IET), 2010-07-22)
A boundary refinement method using a new hidden Markov model (HMM) topology is proposed for automatic phonetic speech segmentation. The proposed method has the ability to work at high frame rates and the training and boundary refinement stages are easy and fast. The method is data driven and can be adapted to any speech segmentation problem provided that a training set is available. Given an initial segmentation obtained by forced alignment using an HMM based phone recogniser, 20% decrease in boundary error...
Hierarchical parallelisation strategy for multilevel fast multipole algorithm in computational electromagnetics
Ergül, Özgür Salih (Institution of Engineering and Technology (IET), 2008-01-03)
A hierarchical parallelisation of the multilevel fast multipole algorithm (MLFMA) for the efficient solution of large-scale problems in computational electromagnetics is presented. The tree structure of MLFMA is distributed among the processors by partitioning both the clusters and the samples of the fields appropriately for each level. The parallelisation efficiency is significantly improved compared to previous approaches, where only the clusters or only the fields are partitioned in a level.
Efficient parallelization of the multilevel fast multipole algorithm for the solution of large-scale scattering problems
Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2008-08-01)
We present fast and accurate solutions of large-scale scattering problems involving three-dimensional closed conductors with arbitrary shapes using the multilevel fast multipole algorithm (MLFMA). With an efficient parallelization of MLFMA, scattering problems that are discretized with tens of millions of unknowns are easily solved on a cluster of computers. We extensively investigate the parallelization of MLFMA, identify the bottlenecks, and provide remedial procedures to improve the efficiency of the imp...
Derivation of length extension formulas for complementary sets of sequences using orthogonal filterbanks
Candan, Çağatay (Institution of Engineering and Technology (IET), 2006-11-23)
A method for the construction of complementary sets of sequences using polyphase representation of orthogonal filterbanks is presented. It is shown that the case of two-channel filterbanks unifies individually derived length extension formulas for complementary sequences into a common framework and the general M-channel case produces novel formulas for the extension of complementary sets of sequences. The presented technique can also be used to generate polyphase and multilevel sequences.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Ö. S. Ergül, “Optimal interpolation of translation operator in multilevel fast multipole algorithm,”
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION
, pp. 3822–3826, 2006, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35737.