Automatic integration using asymptotically optimal adaptive simpson quadrature (Q495532): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The author derives a strategy for constructing an optimal (with respect to the computational cost) adaptive integration method for the integral \(\int_a^b f(x) dx\) based on Simpson's rule. The development is based on the assumption that \(f^{(4)}\) is bounded and strictly positive on \([a,b]\). In view of the well-known definiteness of Simpson's rule, this hypothesis allows to conclude that the sign of the quadrature error is the same over each subinterval. This property substantially simplifies the analysis and the optimality proof of the underlying subdivision strategy, but it also strongly restricts the class of functions for which the algorithm can be proven to be more efficient than other approaches.
Property / review text: The author derives a strategy for constructing an optimal (with respect to the computational cost) adaptive integration method for the integral \(\int_a^b f(x) dx\) based on Simpson's rule. The development is based on the assumption that \(f^{(4)}\) is bounded and strictly positive on \([a,b]\). In view of the well-known definiteness of Simpson's rule, this hypothesis allows to conclude that the sign of the quadrature error is the same over each subinterval. This property substantially simplifies the analysis and the optimality proof of the underlying subdivision strategy, but it also strongly restricts the class of functions for which the algorithm can be proven to be more efficient than other approaches. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Kai Diethelm / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65D32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 41A55 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65Y20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6481917 / rank
 
Normal rank
Property / zbMATH Keywords
 
Simpson formula
Property / zbMATH Keywords: Simpson formula / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical integration
Property / zbMATH Keywords: numerical integration / rank
 
Normal rank
Property / zbMATH Keywords
 
adaptive algorithm
Property / zbMATH Keywords: adaptive algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
optimality
Property / zbMATH Keywords: optimality / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank

Revision as of 22:55, 30 June 2023

scientific article
Language Label Description Also known as
English
Automatic integration using asymptotically optimal adaptive simpson quadrature
scientific article

    Statements

    Automatic integration using asymptotically optimal adaptive simpson quadrature (English)
    0 references
    0 references
    14 September 2015
    0 references
    The author derives a strategy for constructing an optimal (with respect to the computational cost) adaptive integration method for the integral \(\int_a^b f(x) dx\) based on Simpson's rule. The development is based on the assumption that \(f^{(4)}\) is bounded and strictly positive on \([a,b]\). In view of the well-known definiteness of Simpson's rule, this hypothesis allows to conclude that the sign of the quadrature error is the same over each subinterval. This property substantially simplifies the analysis and the optimality proof of the underlying subdivision strategy, but it also strongly restricts the class of functions for which the algorithm can be proven to be more efficient than other approaches.
    0 references
    0 references
    Simpson formula
    0 references
    numerical integration
    0 references
    adaptive algorithm
    0 references
    optimality
    0 references
    complexity
    0 references

    Identifiers