On an approximation algorithm using step functions

zbMATH Open1087.41016MaRDI QIDQ2387005FDOQ2387005

Authors: Yu. A. Dobrosotskaya 

Publication date: 26 August 2005

Published in: Russian Mathematics (Search for Journal in Brave)

Recommendations

• Best piecewise constant approximation of a function of single variable
• Multiple Haar basis and \(m\)-term approximations of functions from the Besov classes. II
• The best \(m\)-term approximation and greedy algorithms
• Universal bases and greedy algorithms for anisotropic function classes
• Approximation Algorithms for Wavelet Transform Coding of Data Streams

Mathematics Subject Classification ID

Approximation by other special function classes (41A30) Rate of convergence, degree of approximation (41A25)

Cited In (3)

• A note on approximation by step functions
• An optimal algorithm for finding all the jumps of a monotone step-function
• Title not available (Why is that?)

This page was built for publication: On an approximation algorithm using step functions

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