Stable high-order quadrature rules with equidistant points (Q2271979): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q117717466, #quickstatements; #temporary_batch_1711234560214
Property / Wikidata QID
 
Property / Wikidata QID: Q117717466 / rank
 
Normal rank

Revision as of 00:40, 24 March 2024

scientific article
Language Label Description Also known as
English
Stable high-order quadrature rules with equidistant points
scientific article

    Statements

    Stable high-order quadrature rules with equidistant points (English)
    0 references
    0 references
    5 August 2009
    0 references
    Newton-Cotes quadrature rules become unstable for high orders. In this paper, the author reviews two techniques to construct stable high-order quadrature rules using \(N\) equidistant quadrature points. The first method is based on results of \textit{M. W. Wilson} [Math. Comput. 24, 271--282 (1970; Zbl 0219.65028)]. The second approach uses nonnegative least squares methods of \textit{C. L. Lawson} and \textit{R. J. Hanson} [Solving least squares problems, SIAM Philadelphia (1995; Zbl 0860.65029)]. The stability follows from the fact that all weights are positive. These results can be achieved in the case \(N\sim d^2\), where \(d\) is the polynomial order of accuracy. Then the computed approximation corresponds implicitly to the integral of a (discrete) least squares approximation of the (sampled) integrand. The author shows how the underlying discrete least squares approximation can be optimized for the numerical integration. Numerical tests are presented.
    0 references
    numerical examples
    0 references
    stable high-order quadrature rules
    0 references
    discrete least squares approximation
    0 references
    discrete orthogonal polynomials
    0 references
    Newton-Cotes quadrature rules
    0 references
    equidistant quadrature points
    0 references
    stability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references