Approximation by piecewise constants on convex partitions

DOI10.1016/j.jat.2011.11.001zbMath1238.41013OpenAlexW2013427511MaRDI QIDQ765690

O. V. Davydov

Publication date: 22 March 2012

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2011.11.001

zbMATH Keywords

linear approximationsaturationpiecewise constant approximation

Mathematics Subject Classification ID

Approximation with constraints (41A29) Saturation in approximation theory (41A40)

Related Items (10)

Error estimates for halfspace regularization of state constrained multiobjective elliptic control problems ⋮ Optimization of transfinite interpolation of functions with bounded Laplacian by harmonic splines on box partitions ⋮ Algorithms and Error Bounds for Multivariate Piecewise Constant Approximation ⋮ Approximation order of Kolmogorov diameters via \(L^q\)-spectra and applications to polyharmonic operators ⋮ An extension of the Kaliszewski cone to non-polyhedral pointed cones in infinite-dimensional spaces ⋮ Multivariate epi-splines and evolving function identification problems ⋮ Approximation by sums of piecewise linear polynomials ⋮ Error estimates for integral constraint regularization of state-constrained elliptic control problems ⋮ Optimal approximation order of piecewise constants on convex partitions ⋮ Stable conical regularization by constructible dilating cones with an application to \(L^{p}\)-constrained optimization problems

Cites Work

• Algorithms and Error Bounds for Multivariate Piecewise Constant Approximation
• The Bramble--Hilbert Lemma for Convex Domains
• Optimal meshes for finite elements of arbitrary order
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation by piecewise constants on convex partitions