A survey of optimal polynomial approximants, applications to digital filter design, and related open problems

From MaRDI portal
Publication:2040243

DOI10.1007/S40627-021-00068-XzbMATH Open1469.30078arXiv2102.01725OpenAlexW3154947686MaRDI QIDQ2040243FDOQ2040243


Authors: Catherine Bénéteau, Raymond Centner Edit this on Wikidata


Publication date: 12 July 2021

Published in: Complex Analysis and its Synergies (Search for Journal in Brave)

Abstract: In the last few years, the notion of optimal polynomial approximant has appeared in the mathematics literature in connection with Hilbert spaces of analytic functions of one or more variables. In the 70s, researchers in engineering and applied mathematics introduced least-squares inverses in the context of digital filters in signal processing. It turns out that in the Hardy space H2 these objects are identical. This paper is a survey of known results about optimal polynomial approximants. In particular, we will examine their connections with orthogonal polynomials and reproducing kernels in weighted spaces and digital filter design. We will also describe what is known about the zeros of optimal polynomial approximants, their rates of decay, and convergence results. Throughout the paper, we state many open questions that may be of interest.


Full work available at URL: https://arxiv.org/abs/2102.01725




Recommendations




Cites Work


Cited In (7)





This page was built for publication: A survey of optimal polynomial approximants, applications to digital filter design, and related open problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2040243)