← Back to papers
Polynomial approximation on disjoint segments and amplification of approximation
Y. Malykhin, Konstantin Ryutin·June 20, 2023·DOI: 10.48550/arXiv.2306.11613
MathematicsComputer Science
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical analysis, complexity theory, quantum algorithms, etc. The one, most relevant for us, is the amplification of approximation method: it allows to construct approximations of higher degree $M$ and better accuracy from the approximations of degree $m$.