Adaption helps for some nonconvex classes (Q579828): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
The problem of numerical integration of functions from a given class F is considered. It is shown that if F is convex and balanced then adaptive quadrature algorithms are not better than nonadaptive ones. Examples of nonconvex classes of functions F for which adaption is substantially better than nonadaption are presented. From a practical point of view the adaptive algorithms constructed may not be suitable because they require knowledge of parameters, difficult to specify a priori. | |||
Property / review text: The problem of numerical integration of functions from a given class F is considered. It is shown that if F is convex and balanced then adaptive quadrature algorithms are not better than nonadaptive ones. Examples of nonconvex classes of functions F for which adaption is substantially better than nonadaption are presented. From a practical point of view the adaptive algorithms constructed may not be suitable because they require knowledge of parameters, difficult to specify a priori. / 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 / zbMATH DE Number | |||
Property / zbMATH DE Number: 4016022 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
adaptive quadrature algorithms | |||
Property / zbMATH Keywords: adaptive quadrature algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nonconvex classes of functions | |||
Property / zbMATH Keywords: nonconvex classes of functions / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Eduard Eitelberg / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the optimality of linear methods for operator approximation in convex classes of functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal sequential and non-sequential procedures for evaluating a functional / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4113344 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Metalgorithm for Adaptive Quadrature / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bisection is optimal / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3883494 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:13, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Adaption helps for some nonconvex classes |
scientific article |
Statements
Adaption helps for some nonconvex classes (English)
0 references
1986
0 references
The problem of numerical integration of functions from a given class F is considered. It is shown that if F is convex and balanced then adaptive quadrature algorithms are not better than nonadaptive ones. Examples of nonconvex classes of functions F for which adaption is substantially better than nonadaption are presented. From a practical point of view the adaptive algorithms constructed may not be suitable because they require knowledge of parameters, difficult to specify a priori.
0 references
adaptive quadrature algorithms
0 references
nonconvex classes of functions
0 references
0 references