scientific article; zbMATH DE number 850399

MaRDI QIDQ4866424zbMATH OpenFDO

Authors S. B. Gashkov

Publication date 31 October 1996

zbMATH Keywords

complexitiescomplexity of \(\epsilon\)-approximationcontinuous functionsdepthformulaspolynomialsschemes

Mathematics Subject Classification ID

Approximation by polynomials (41A10)

Recommendations

• scientific article; zbMATH DE number 139637
• Complexity of approximate realization of functions, satisfying the Lipschitz condition, by schemes in continuous bases
• scientific article; zbMATH DE number 1166265

Cited in

(10)

• On the complexity of the approximate realization of certain classes of differentiable functions of one variable by formulas in certain continuous bases
• On the complexity of approximate realization for classes of functions of several variables by schemes and formulas in bases of continuous functions
• On the complexity of the approximation of functions with given moduli of continuity of the first and second orders in some piecewise linear and polynomial bases
• Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases
• scientific article; zbMATH DE number 3884099 (Why is no real title available?)
• scientific article; zbMATH DE number 4046332 (Why is no real title available?)
• scientific article; zbMATH DE number 139637 (Why is no real title available?)
• scientific article; zbMATH DE number 1166265 (Why is no real title available?)
• Chair of Discrete Mathematics
• Complexity of approximate realization of functions, satisfying the Lipschitz condition, by schemes in continuous bases

This page was built for publication:

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