首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Markov-Bernstein inequalities for generalized Gegenbauer weight
Authors:André Draux  Mohamed Sadik
Institution:a INSA de Rouen, Département de Génie Mathématique, Campus de Saint-Étienne-du-Rouvray, Avenue de l?université, BP 8, F-76801 Saint-Étienne-du-Rouvray Cedex, France
b Académie Militaire, 8012 Fondouk-Jedid, Tunisia
Abstract:The Markov-Bernstein inequalities for generalized Gegenbauer weight are studied. A special basis of the vector space Pn of real polynomials in one variable of degree at most equal to n is proposed. It is produced by quasi-orthogonal polynomials with respect to this generalized Gegenbauer measure. Thanks to this basis the problem to find the Markov-Bernstein constant is separated in two eigenvalue problems. The first has a classical form and we are able to give lower and upper bounds of the Markov-Bernstein constant by using the Newton method and the classical qd algorithm applied to a sequence of orthogonal polynomials. The second is a generalized eigenvalue problem with a five diagonal matrix and a tridiagonal matrix. A lower bound is obtained by using the Newton method applied to the six term recurrence relation produced by the expansion of the characteristic determinant. The asymptotic behavior of an upper bound is studied. Finally, the asymptotic behavior of the Markov-Bernstein constant is O(n2) in both cases.
Keywords:Markov-Bernstein inequalities  Gegenbauer polynomials  Generalized Gegenbauer polynomials  Quasi-orthogonal polynomials  Eigenvalue problem  Generalized eigenvalue problem  qd Algorithm
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号