Generalized qd algorithm and Markov–Bernstein inequalities for Jacobi weight

The Markov–Bernstein inequalities for the Jacobi measure remained to be studied in detail. Indeed the tools used for obtaining lower and upper bounds of the constant which appear in these inequalities, did not work, since it is linked with the smallest eigenvalue of a five diagonal positive definite...

Full description

Saved in:

Bibliographic Details
Published in:	Numerical algorithms Vol. 51; no. 4; pp. 429 - 447
Main Authors:	Draux, André, Moalla, Borhane, Sadik, Mohamed
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.08.2009 Springer Nature B.V Springer Verlag
Subjects:	Algebra Algorithms Computer Science Constants Determinants Eigenvalues Inequalities Mathematical analysis Mathematics Matrices (mathematics) Numeric Computing Numerical Analysis Oroginal Paper Symmetry Theory of Computation Upper bounds Jacobi polynomials Gegenbauer polynomials 33C45 26C10 Orthogonal polynomials LR algorithm Markov–Bernstein inequalities qd algorithm 42C05 26D05
ISSN:	1017-1398, 1572-9265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!