Fast and reliable algorithms for computing the zeros of Althammer polynomials

DOI10.1016/J.APNUM.2024.09.004MaRDI QIDQ6646509FDOQ6646509

Authors: T. Laudadio, Nicola Mastronardi, Paul van Dooren 

Publication date: 2 December 2024

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Calculation of Gauss Quadrature Rules
• On Sobolev orthogonal polynomials
• Title not available (Why is that?)
• On polynomials orthogonal with respect to certain Sobolev inner products
• Balancing a matrix for calculation of eigenvalues and eigenvectors
• Orthogonal polynomials (in Matlab)
• Computing orthogonal polynomials in Sobolev spaces
• Eine Erweiterung des Orthogonalitätsbegriffes bei Polynomen und deren Anwendung auf die beste Approximation.
• Zu den Orthogonalpolynomen von Althammer.
• Title not available (Why is that?)
• On generating Sobolev orthogonal polynomials

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)