Article contents
On Tchebycheff Quadrature
Published online by Cambridge University Press: 20 November 2018
Extract
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).
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1965
References
- 2
- Cited by