• DocumentCode
    1362690
  • Title

    Efficient computation of the free-space periodic Green´s function

  • Author

    Singh, Surendra ; Singh, Ritu

  • Author_Institution
    Dept. of Electr. Eng., Tulsa Univ., OK, USA
  • Volume
    39
  • Issue
    7
  • fYear
    1991
  • fDate
    7/1/1991 12:00:00 AM
  • Firstpage
    1226
  • Lastpage
    1229
  • Abstract
    The application of Shanks´s transform is shown to improve the convergence of the series representing the doubly infinite free-space periodic Green´s function. Higher order Shanks transforms are computed via Wynn´s epsilon algorithm. Numerical results confirm that a dramatic improvement in the convergence rate is obtained for the on-plane case, in which the series converges extremely slowly. In certain instances, the computation time can be reduced by as much as a factor of a few thousands. A relative error measure versus the number of terms taken in the series is plotted for various values of a convergence factor as the observation point is varied within a unit cell. Computation times are also provided.
  • Keywords
    Green´s function methods; computational complexity; convergence of numerical methods; Shanks´s transform; Wynn´s epsilon algorithm; computation time; convergence factor; doubly infinite free-space periodic Green´s function; efficient computation; on-plane case; Acceleration; Computational efficiency; Convergence of numerical methods; Cost function; Geometry; Green´s function methods; Integral equations; Lattices; Moment methods; Scattering;
  • fLanguage
    English
  • Journal_Title
    Microwave Theory and Techniques, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9480
  • Type

    jour

  • DOI
    10.1109/22.85392
  • Filename
    85392