Speakers
Konstantin Ryutin
(Lomonosov Moscow State University and Moscow Center of Fundamental and Applied Mathematics)
Yuri Malykhin
(Steklov Mathematical Institute of RAS, Moscow)
Description
We plan to talk about explicit explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments and some more general disjoint sets.
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$. Such constructions are used in linear algebra, computer science (communication complexity).
Primary authors
Konstantin Ryutin
(Lomonosov Moscow State University and Moscow Center of Fundamental and Applied Mathematics)
Yuri Malykhin
(Steklov Mathematical Institute of RAS, Moscow)
