Fast and reliable algorithms for computing the zeros of Althammer polynomials

DOI10.1016/J.APNUM.2024.09.004MaRDI QIDQ6646509zbMATH OpenFDO

Authors T. Laudadio, Nicola Mastronardi, Paul van Dooren

Publication date 2 December 2024

Published in Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

zerosSobolev orthogonal polynomialsHessenberg eigenvalue problem

Mathematics Subject Classification ID

Other special orthogonal polynomials and functions (33C47) Numerical computation of roots of polynomial equations (65H04)

Recommendations

• scientific article; zbMATH DE number 1837506
• scientific article; zbMATH DE number 811999
• Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries
• A composite polynomial zerofinding matrix algorithm
• Location of the zeros of orthogonal polynomials with an automatic procedure. I

Cites work

• scientific article; zbMATH DE number 19414 (Why is no real title available?)
• scientific article; zbMATH DE number 749875 (Why is no real title available?)
• scientific article; zbMATH DE number 2107939 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• Balancing a matrix for calculation of eigenvalues and eigenvectors
• Calculation of Gauss Quadrature Rules
• Computing orthogonal polynomials in Sobolev spaces
• Eine Erweiterung des Orthogonalitätsbegriffes bei Polynomen und deren Anwendung auf die beste Approximation.
• On Sobolev orthogonal polynomials
• On generating Sobolev orthogonal polynomials
• On polynomials orthogonal with respect to certain Sobolev inner products
• Orthogonal polynomials (in Matlab)
• Zu den Orthogonalpolynomen von Althammer.

This page was built for publication: Fast and reliable algorithms for computing the zeros of Althammer polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646509)