About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Conference paper
Efficient method for computing nodes and weights of Gaussian-Zernike quadrature
Abstract
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. The method allows direct computation of the nodes and weights for any given order, therefore, can be embedded in application programs 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 facilitates application of the Gaussian-Zernike quadrature to large antennas, for which the advantages resulted from reduced number of sampling points become remarkable.