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

DOI10.1007/BF01904781MaRDI QIDQ1065487zbMATH OpenFDO

Authors Gy. Sonnevend

Publication date 1984

Published in Analysis Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01904781

zbMATH Keywords

adaptive algorithmsmonotone derivativesoptimal order global errorsequential algorithmsuniform recovery of functions

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Approximation with constraints (41A29) Numerical interpolation (65D05) Numerical computation using splines (65D07)

Review text

Seien \(r\in {\mathbb{N}}\), \(r\geq 2\), \(a=\tau_ 1\leq \tau_ 2\leq...\leq \tau_{r+1}=b\), \(K^ 0:=\{z| z(\tau_ i)=x(\tau_ i)\), \(i=1,...,r+1\); \(z^{(r-1)}\) monoton nicht abnehmend in [a,b]\(\}\) und \(x\in K^ 0\) die zu approximierende Funktion. Es wird eine Klasse sequentieller Algorithmen zur Wahl von Knoten \(t_ 1,...,t_ N\) und hiermit erzeugter Approximationen an x bezüglich \(K^ 0\) kontruiert. Nach Einführung geeigneter individueller und globaler Fehlerbegriffe wird gezeigt, daß diese adaptiven Verfahren in einem bestimmten Sinn (Ordnung in N) besser sind als passive Verfahren mit simultaner Knotenwahl.

Recommendations

• Optimization of adaptive algorithms for the renewal of monotone functions from the class H^
• scientific article; zbMATH DE number 4115196
• On passive and active algorithms of reconstruction of functions
• scientific article; zbMATH DE number 3879983
• scientific article; zbMATH DE number 3956307

Cites work

• A practical guide to splines.
• An adaptive algorithm for multivariate approximation giving optimal convergence rates
• An optimal sequential algorithm for the uniform approximation of convex functions on \([0,1]^ 2\)
• Best choice of knots in approximation of functions by local Hermitian splines
• scientific article; zbMATH DE number 3687220 (Why is no real title available?)
• scientific article; zbMATH DE number 3688714 (Why is no real title available?)
• scientific article; zbMATH DE number 3696362 (Why is no real title available?)
• scientific article; zbMATH DE number 3708924 (Why is no real title available?)
• scientific article; zbMATH DE number 3735648 (Why is no real title available?)
• scientific article; zbMATH DE number 3588584 (Why is no real title available?)
• Necessary and sufficient conditions for interpolation with functions having monotone r-th derivatives
• Piecewise polynomial approximation on optimal meshes

Cited in

(4)

• 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
• Necessary and sufficient conditions for interpolation with functions having monotone r-th derivatives

This page was built for publication: Sequential algorithms of optimal order global error for the uniform recovery of functions with monotone (r-1) derivatives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065487)