In this paper, anti-Gaussian quadrature rules for trigonometric polynomials are introduced. Special attention is paid to an even weight function on [-?, ?). The main properties of such proved and a numerical method their construction presented. That based relations between nodes weights the rule algebraic polynomials. Some examples included. Also, we compare our with other available methods.

It has been suggested in the literature that different quasi-uniform node sets on a sphere lead to quadrature formulas of highly variable quality. We analyze here the nature of these variations, and describe an easy-to-implement leastsquares remedy for previously problematic cases. Quadrature accuracies are then compared for different node sets ranging from fully random to those based on Gaussi...

this paper proposes a hybrid method to find cumulative distribution function (cdf) of completion time of gert-type networks (gtn) which have no loop and have only exclusive-or nodes. proposed method is cre-ated by combining an analytical transformation with gaussian quadrature formula. also the combined crude monte carlo simulation and combined conditional monte carlo simulation are developed a...