2000 character limit reached
Polynomial approximation on disjoint segments and amplification of approximation
Published 20 Jun 2023 in math.FA and cs.CC | (2306.11613v2)
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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.