pith. sign in

arxiv: 1706.06295 · v2 · pith:YLJZ6JXXnew · submitted 2017-06-20 · 🧮 math.CA

On zeros of polynomials in best L^p-approximation and inserting mass points

classification 🧮 math.CA
keywords zerosmarkovmonotonicitypolynomialsallowsanalapproximationbest
0
0 comments X
read the original abstract

The purpose of this note is to revive in $L^p$ spaces the original A. Markov ideas to study monotonicity of zeros of orthogonal polynomials. This allows us to prove and improve in a simple and unified way our previous result [Electron. Trans. Numer. Anal., 44 (2015), pp. 271-280] concerning the discrete version of A. Markov's theorem on monotonicity of zeros.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.