On Tchebycheff Quadrature
1965 ◽
Vol 17
◽
pp. 652-658
◽
Tchebycheff proposed the problem of finding n + 1 constants A, x1, x2, . . , xn ( — 1 ≤ x1 < x2 < . . . < xn ≤ +1) such that the formula(1)is exact for all algebraic polynomials of degree ≤n. In this case it is clear that A = 2/n. Later S. Bernstein (1) proved that for n ≥ 10 not all the xi's can be real. For a history of the problem and for more references see Natanson (4).
1875 ◽
Vol 8
◽
pp. 50-51
◽
1983 ◽
Vol 94
(1)
◽
pp. 1-8
◽
1908 ◽
Vol 28
◽
pp. 197-209
Keyword(s):
1963 ◽
Vol 59
(1)
◽
pp. 95-110
◽
1969 ◽
Vol 3
(4)
◽
pp. 611-631
◽
Keyword(s):
2010 ◽
Vol 214
◽
pp. F73-F82
◽
Keyword(s):