![]() |
ETNA - Electronic Transactions on Numerical Analysis
|
![]() |
Verlag der Österreichischen Akademie der Wissenschaften Austrian Academy of Sciences Press
A-1011 Wien, Dr. Ignaz Seipel-Platz 2
Tel. +43-1-515 81/DW 3420, Fax +43-1-515 81/DW 3400 https://verlag.oeaw.ac.at, e-mail: verlag@oeaw.ac.at |
|
||||||||||||||||||||
|
DATUM, UNTERSCHRIFT / DATE, SIGNATURE
BANK AUSTRIA CREDITANSTALT, WIEN (IBAN AT04 1100 0006 2280 0100, BIC BKAUATWW), DEUTSCHE BANK MÜNCHEN (IBAN DE16 7007 0024 0238 8270 00, BIC DEUTDEDBMUC)
|

ETNA - Electronic Transactions on Numerical Analysis, pp. 517-532, 2026/10/13
Gegenbauer–Sobolev polynomials are related to the classical Gegenbauer polynomials, and they satisfy orthogonality relations with respect to a Sobolev inner product.
In this paper, we focus on the study of the location and computation of the zeros of Gegenbauer–Sobolev polynomials. In particular, some interlacing properties between the zeros of the Gegenbauer–Sobolev polynomials and those of the Gegenbauer polynomials are shown. Moreover, two variants of a Newton-like method, known as the Ehrlich–Aberth method, are applied to compute the zeros of the considered polynomials.
The Ehrlich–Aberth method is iterative, requiring the evaluation of the polynomial and its derivative at all the approximations of the zeros. This is accomplished by exploiting a relation that links the sequence of Gegenbauer–Sobolev polynomials with the sequence of Gegenbauer polynomials.
Furthermore, in order to ensure fast convergence, the proposed algorithms exploit the derived interlacing properties to construct the initial guesses of the zeros required by the Ehrlich–Aberth method.
The algorithms are shown to be accurate and very fast, with a computational complexity of the order of $\mathcal{O}(n^2)$ for a Gegenbauer–Sobolev polynomial of degree $n$.
Keywords: Sobolev orthogonal polynomials, Gegenbauer polynomials, zeros of polynomials