Numerical computation of 2D sommerfeld integrals- A novel asymptotic extraction technique

Steven L. Dvorak, Edward F. Kuester

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

The accurate and efficient computation of the elements in the impedance matrix is a crucial step in the application of Galerkin's method to the analysis of planar structures. As was demonstrated in a previous paper, it is possible to decompose the angular integral, in the polar representation for the 2D Sommerfeld integrals, in terms of incomplete Lipschitz-Hankel integrals (ILHIs) when piecewise sinusoidal basis functions are employed. Since Bessel series expansions can be used to compute these ILHIs, a numerical integration of the inner angular integral is not required. This technique provides an efficient method for the computation of the inner angular integral; however, the outer semi-infinite integral still converges very slowly when a real axis integration is applied. Therefore, it is very difficult to compute the impedance elements accurately and efficiently. In this paper, it is shown that this problem can be overcome by using the ILHI representation for the angular integral to develop a novel asymptotic extraction technique for the outer semi-infinite integral. The usefulness of this asymptotic extraction technique is demonstrated by applying it to the analysis of a printed strip dipole antenna in a layered medium.

Original languageEnglish (US)
Pages (from-to)217-230
Number of pages14
JournalJournal of Computational Physics
Volume98
Issue number2
DOIs
StatePublished - Feb 1992

ASJC Scopus subject areas

  • Numerical Analysis
  • Modeling and Simulation
  • Physics and Astronomy (miscellaneous)
  • Physics and Astronomy(all)
  • Computer Science Applications
  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Numerical computation of 2D sommerfeld integrals- A novel asymptotic extraction technique'. Together they form a unique fingerprint.

Cite this