Polynomial approximation on disjoint segments and amplification of approximation

06/20/2023
by   Yuri Malykhin, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2021

Disjoint axis-parallel segments without a circumscribing polygon

We construct a family of 17 disjoint axis-parallel line segments in the ...
research
10/03/2018

Inner Approximation of Minkowski Sums: A Union-Based Approach and Applications to Aggregated Energy Resources

This paper develops and compares algorithms to compute inner approximati...
research
09/09/2019

PowerNet: Efficient Representations of Polynomials and Smooth Functions by Deep Neural Networks with Rectified Power Units

Deep neural network with rectified linear units (ReLU) is getting more a...
research
08/29/2021

Linking disjoint segments into a simple polygon is hard

Deciding whether a family of disjoint line segments in the plane can be ...
research
02/11/2022

Dandelion: Certified Approximations of Elementary Functions

Elementary function operations such as sin and exp cannot in general be ...
research
08/09/2021

The mysteries of the best approximation and Chebyshev expansion for the function with logarithmic regularities

The best polynomial approximation and Chebyshev approximation are both i...
research
09/01/2023

Polynomial Interpolation of Function Averages on Interval Segments

Motivated by polynomial approximations of differential forms, we study a...

Please sign up or login with your details

Forgot password? Click here to reset