Contributions

The principal ideas about the algorithm are due to Gauss. Other ideas go back to Chebyshev, Weierstrass and Gram, just to mention the classics.

The theoretical background for the algorithm is contained in the two papers:
[1] I. Area, D. K. Dimitrov, E. Godoy, and V. G. Paschoa, Approximate calculation of sums I: Bounds for the zeros of Gram polynomials, SIAM J. Numer. Anal. 52 (2014), pp. 1867– 1886.
[2] I. Area, D. K. Dimitrov, E. Godoy, and V. G. Paschoa, Approximate calculation of sums II: Gaussian type quadrature, SIAM J. Numer. Anal. 54 (2016), pp. 2210–2227.

DKD thanks warm-heartedly his coauthors.

The present project was developed by DKD and LLP, under the guidance of DKD and the codes were implemented by LLP.

This site is kindly maintained by Thiago L. Parolin.