On the complexity of the approximate table representation of discrete analogs of functions of finite smoothness in the metric of \(L^p\)

DOI10.1007/BF02316279zbMath0938.65026MaRDI QIDQ1966246

G. G. Amanzhaev

Publication date: 25 June 2000

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

complexitytable representation\(L^p\)-metricdiscrete approximation of functionfunction of finite smoothness

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Discrete analogs of classes of continuous functions with different smoothness
• On discrete analogues of classes of functions defined by \(n\)-th derivative continuity modulus
• On discrete analogues of fractional smoothness functions

This page was built for publication: On the complexity of the approximate table representation of discrete analogs of functions of finite smoothness in the metric of \(L^p\)