Sequential algorithms of optimal order global error for the uniform recovery of functions with monotone (r-1) derivatives

DOI10.1007/BF01904781zbMath0577.65002MaRDI QIDQ1065487

Gy. Sonnevend

Publication date: 1984

Published in: Analysis Mathematica (Search for Journal in Brave)

zbMATH Keywords

adaptive algorithms; sequential algorithms; monotone derivatives; optimal order global error; uniform recovery of functions

Mathematics Subject Classification ID

65D07: Numerical computation using splines

65D05: Numerical interpolation

41A29: Approximation with constraints

41A25: Rate of convergence, degree of approximation

Related Items

Necessary and sufficient conditions for interpolation with functions having monotone r-th derivatives, On the complexity of following the central path of linear programs by linear extrapolation. II, The convergence rate of the sandwich algorithm for approximating convex functions, Sandwich approximation of univariate convex functions with an application to separable convex programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal sequential algorithm for the uniform approximation of convex functions on \([0,1^ 2\)]
• Necessary and sufficient conditions for interpolation with functions having monotone r-th derivatives
• Best choice of knots in approximation of functions by local Hermitian splines
• Piecewise polynomial approximation on optimal meshes
• An adaptive algorithm for multivariate approximation giving optimal convergence rates
• A practical guide to splines.