• Ronny Ramlau, Lothar Reichel (Hg.)

ETNA - Electronic Transactions on Numerical Analysis

Bild


Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal for the publication of significant new developments in numerical analysis and scientific computing. Papers of the highest quality that deal with the analysis of algorithms for the solution of continuous models and numerical linear algebra are appropriate for ETNA, as are papers of similar quality that discuss implementation and performance of such algorithms. New algorithms for current or new computer architectures are appropriate provided that they are numerically sound. However, the focus of the publication should be on the algorithm rather than on the architecture. The journal is published by the Kent State University Library in conjunction with the Institute of Computational Mathematics at Kent State University, and in cooperation with the Johann Radon Institute for Computational and Applied Mathematics of the Austrian Academy of Sciences (RICAM). Reviews of all ETNA papers appear in Mathematical Reviews and Zentralblatt für Mathematik. Reference information for ETNA papers also appears in the expanded Science Citation Index. ETNA is registered with the Library of Congress and has ISSN 1068-9613.

…

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

Bestellung/Order


Bild
ETNA - Electronic Transactions on Numerical Analysis



ISBN 978-3-7001-8258-0
Online Edition



Send or fax to your local bookseller or to:

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: bestellung.verlag@oeaw.ac.at
UID-Nr.: ATU 16251605, FN 71839x Handelsgericht Wien, DVR: 0096385

Bitte senden Sie mir
Please send me
 
Exemplar(e) der genannten Publikation
copy(ies) of the publication overleaf


NAME


ADRESSE / ADDRESS


ORT / CITY


LAND / COUNTRY


ZAHLUNGSMETHODE / METHOD OF PAYMENT
    Visa     Euro / Master     American Express


NUMMER

Ablaufdatum / Expiry date:  

    I will send a cheque           Vorausrechnung / Send me a proforma invoice
 
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)
Bild

Fast and accurate computation of the zeros of Gegenbauer-Sobolev orthogonal polynomials

    Teresa Laudadio, Francisco José Marcellán Español, Nicola Mastronardi, Niel Van Buggenhout, Paul Van Dooren

ETNA - Electronic Transactions on Numerical Analysis, pp. 517-532, 2026/10/13

doi: 10.1553/etna_vol65s517

doi: 10.1553/etna_vol65s517


PDF
X
BibTEX-Export:

X
EndNote/Zotero-Export:

X
RIS-Export:

X 
Researchgate-Export (COinS)

Permanent QR-Code

doi:10.1553/etna_vol65s517



doi:10.1553/etna_vol65s517

Abstract

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