Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Efficient algorithms for computing Sommerfeld integral tails
 
research article

Efficient algorithms for computing Sommerfeld integral tails

Golubovic, R.  
•
Polimeridis, A. G.  
•
Mosig, J. R.  
2012
IEEE Transactions on Antennas and Propagation

Sommerfeld-integrals (SIs) are ubiquitous in the analysis of problems involving antennas and scatterers embedded in planar multilayered media. It is well known that the oscillating and slowly decaying nature of their integrands makes the numerical evaluation of the SI real-axis tail segment a very time consuming and computationally expensive task. Therefore, SI tails have to be specially treated. In this paper we compare two recently developed techniques for their efficient numerical evaluation. First, a partition-extrapolation method, in which the integration-then-summation procedure is combined with a new version of the weighted averages (WA) extrapolation technique, is summarized. The previous variants of WA technique are also discussed. Then, a review of double-exponential (DE) quadrature formulas for direct integration of the SI tails is presented. The efficient way of implementing the algorithms, their pros and cons, as well as comparisons of their performance are discussed in detail.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

Golubovic_etal_TAP2012_1.pdf

Access type

openaccess

Size

2.39 MB

Format

Adobe PDF

Checksum (MD5)

7f2f1995045ee530782b42e1830e13d6

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés