Existence of quadrature formulae with almost equal weights
K. Šalkauskas
Abstract
K. Šalkauskas
Abstract
The condition that an interpolatory quadrature formula on n nodes have degree of precision at least n and positive weights defines a homeomorphism between the sets of admissible nodes and weights of such formulae for each n . This is used to prove that the only formulae having "almost equal" weights are the Chebyshev formulae.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The condition that an interpolatory quadrature formula on n nodes have degree of precision at least n and positive weights defines a homeomorphism between the sets of admissible nodes and weights of such formulae for each n . This is used to prove that the only formulae having "almost equal" weights are the Chebyshev formulae.
Key concepts: Mathematics, Quadrature (astronomy), Chebyshev filter, Combinatorics, Mathematical analysis, Engineering, Electrical engineering