Theoretical and practical efficiency measures for symmetric interpolatory quadrature formulas (Q1347075): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3323133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing automatic quadrature programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolatory integration formulas for optimal composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 691: Improving QUADPACK automatic integration routines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic expansion of error in interpolatory quadrature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of automatic quadrature / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technique for comparing automatic quadrature routines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Versus Global Strategies for Adaptive Quadrature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4746719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of high-order integration formulae for the adaptive quadrature method / rank
 
Normal rank

Latest revision as of 12:33, 23 May 2024

scientific article
Language Label Description Also known as
English
Theoretical and practical efficiency measures for symmetric interpolatory quadrature formulas
scientific article

    Statements

    Theoretical and practical efficiency measures for symmetric interpolatory quadrature formulas (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 November 1995
    0 references
    The authors demonstrate that a certain theoretical measure of the efficiency of a quadrature rule also provides practical information about the efficiency of the quadrature rule when the rule is used as the local rule for a globally adaptive algorithm. For a degree \(d-1\) rule, the efficiency measure \(R\), which was developed in an earlier paper by the authors and \textit{G. Di Marco} [Asymptotic behavior of automatic quadrature, J. Complexity 10, No. 3, 296-340 (1994)], depends only on the number of nodes for the rule and the rule integration error for the degree \(d\) monomial. Much of the paper establishes notation and terminology developed in earlier work by the authors. The main result is reported in the last section of the paper. In this section test results are given that show a high correlation between the \(R\) value for a rule and the average number of function evaluations needed by a globally adaptive algorithm, which uses the rule, to attain a specified level of accuracy.
    0 references
    0 references
    quadrature rule
    0 references
    adaptive algorithm
    0 references
    efficiency measure
    0 references
    0 references