The concept of sequential optimality for problems in numerical analysis
DOI10.1016/0885-064X(87)90020-3zbMATH Open0637.65049MaRDI QIDQ1098565FDOQ1098565
Authors: Aleksei G. Sukharev 
Publication date: 1987
Published in: Journal of Complexity (Search for Journal in Brave)
Recommendations
worst-case analysisnumerical integration of monotonic functionssequential optimalitysequentially optimal algorithms
Numerical quadrature and cubature formulas (65D32) Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) General theory of numerical analysis in abstract spaces (65J05) Algorithms in computer science (68W99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A sequentially optimal algorithm for numerical integration
- Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A stochastic algorithm for extremum search, optimal in one step
Cited In (11)
- Title not available (Why is that?)
- Discussion on “An effective method for the explicit solution of sequential problems on the real line” by Sören Christensen
- Quadrature Formulas for Monotone Functions
- Some problems in approximation theory and numerical analysis
- Approximation in p-norm of univariate concave functions
- On adaptive and non-adaptive stochastic and deterministic algorithms
- Title not available (Why is that?)
- Optimum/adaptive incremental sequence in nonlinear analysis
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse
- Determining zeroes of increasing Lipschitz functions
- Title not available (Why is that?)
This page was built for publication: The concept of sequential optimality for problems in numerical analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098565)
