Stieltjes interlacing of zeros of little q-Jacobi and q-Laguerre polynomials from different sequences

Stieltjes interlacing states that if { p n ( z ) } n = 0 ∞ is a sequence of orthogonal polynomials, then there is at least one zero of p n ( z ) in between any two consecutive zeros of p m ( z ), where m < n − 1. Stieltjes interlacing holds for the zeros of polynomials from different sequences of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Numerical algorithms 2023, Vol.92 (1), p.723-746
Hauptverfasser:	Kar, Pinaki Prasad, Jordaan, Kerstin, Gochhayat, Priyabrat
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Algorithms Computer Science Numeric Computing Numerical Analysis Original Paper Polynomials Theory of Computation Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!