Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

Approximation by piecewise constants on convex partitions

Davydov, O. (2012) Approximation by piecewise constants on convex partitions. Journal of Approximation Theory, 164 (2). pp. 346-352. ISSN 0021-9045

Full text not available in this repository. Request a copy from the Strathclyde author

Abstract

We show that the saturation order of piecewise constant approximation in Lp norm on convex partitions with N cells is N−2/(d+1), where d is the number of variables. This order is achieved for any on a partition obtained by a simple algorithm involving an anisotropic subdivision of a uniform partition. This improves considerably the approximation order N−1/d achievable on isotropic partitions. In addition we show that the saturation order of piecewise linear approximation on convex partitions is N−2/d, the same as on isotropic partitions.