Title :
An efficient method for computing nodes and weights of Gaussian-Zernike quadrature
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Abstract :
The properties of the underlying Zernike-circle polynomials of the Gaussian-Zernike quadrature are investigated, and an extremely efficient method for computing the nodes and weights is devised. In contrast to the "sequential" method that computes the nodes and weights of a given order based on those of one order lower, the present method eliminates this dependency, and allows direct computation of the nodes and weights for any given order. Therefore, an implementation of the present method can be embedded in application programs in order to calculate the Gaussian-Zernike quadrature formula on the fly. Another advantage of the present method is that it is easy to implement. This new method of evaluating nodes and weights facilitates application of the Gaussian-Zernike quadrature to large antennas, for which the advantages resulted from the reduced number of sampling points become remarkable. Examples of physical optics (PO) analysis for very large reflector antennas are demonstrated.
Keywords :
Gaussian processes; antenna radiation patterns; physical optics; polynomials; reflector antennas; Gaussian-Zernike quadrature; PO analysis; Zernike-circle polynomials; application programs; efficient method; far field patterns; large antennas; nodes; physical optics; reflector antennas; sampling points reduction; weights; Algorithms; Aperture antennas; Availability; Convergence; Gaussian processes; Integral equations; Newton method; Physical optics; Polynomials; Sampling methods;
Conference_Titel :
Antennas and Propagation Society International Symposium, 1997. IEEE., 1997 Digest
Conference_Location :
Montreal, Quebec, Canada
Print_ISBN :
0-7803-4178-3
DOI :
10.1109/APS.1997.631486