Convergence of an algorithm for constructing snakes

DOI10.1007/BF01056667MaRDI QIDQ4866491zbMATH OpenFDO

Authors V. K. Dzjadyk, V. V. Kovtunets

Publication date 5 May 1996

Published in Ukrainian Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

Chebyshev systemKarlinsnakes

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Approximation with constraints (41A29)

Recommendations

• Convergence of r-algorithms
• scientific article; zbMATH DE number 1189324
• Convergence of discrete snakes
• Convergence of the greedy algorithm for continuous functions
• A convergence result for the B-algorithm
• On convergence of weak greedy algorithms
• scientific article; zbMATH DE number 4199498
• scientific article; zbMATH DE number 13215
• The convergence rate of the sandwich algorithm for approximating convex functions
• A criterion for convergence of weak greedy algorithms

Cited in

(1)

• On the on-line number of snacks problem

This page was built for publication: Convergence of an algorithm for constructing snakes

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