Polynomial approximation on disjoint segments and amplification of approximation
Functional Analysis
2023-11-29 v2 Computational Complexity
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 and better accuracy from the approximations of degree .
Cite
@article{arxiv.2306.11613,
title = {Polynomial approximation on disjoint segments and amplification of approximation},
author = {Yuri Malykhin and Konstantin Ryutin},
journal= {arXiv preprint arXiv:2306.11613},
year = {2023}
}