The concept of sequential optimality for problems in numerical analysis

DOI10.1016/0885-064X(87)90020-3zbMath0637.65049MaRDI QIDQ1098565

Aleksei G. Sukharev

Publication date: 1987

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

worst-case analysisnumerical integration of monotonic functionssequential optimalitysequentially optimal algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General theory of numerical analysis in abstract spaces (65J05) Roundoff error (65G50) Numerical quadrature and cubature formulas (65D32) Algorithms in computer science (68W99)

Related Items (5)

Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse ⋮ Approximation in p-norm of univariate concave functions ⋮ Quadrature Formulas for Monotone Functions ⋮ On adaptive and non-adaptive stochastic and deterministic algorithms ⋮ Determining zeroes of increasing Lipschitz functions

Cites Work

• A sequentially optimal algorithm for numerical integration
• Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
• A stochastic algorithm for extremum search, optimal in one step
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The concept of sequential optimality for problems in numerical analysis