By Topic

Fast integral equation-fourier transformation algorithm with grid-robust higher-order vector basis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Feng, X. ; Sch. of Electron. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Hu, J. ; Yin, J. ; Nie, Z.

An integral equation-fast Fourier transformation (IE-FFT) with grid-robust higher order vector basis functions (BFs) are presented. A conformal mesh is required for traditional BFs based on common edges between adjacent elements. This is a very rigorous requirement for large and complicated electrical geometries. Instead of a conformal mesh, grid-robust higher-order vector BFs are used here. It maintains the flexibility of geometry modelling and reduces the number of the unknowns owing to the property of point BFs. An IE-FFT algorithm based on a flexible floating stencil topology is proposed to accelerate the solution of the IE. Comparing the IE-FFT with traditional RWG BFs, the present method has a much lower error of interpolation, and the matrix is also simpler to implement. Numerical results are presented to demonstrate the accuracy and efficiency of this method.

Published in:

Microwaves, Antennas & Propagation, IET  (Volume:5 ,  Issue: 14 )