Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
From MaRDI portal
Recommendations
- Orthogonal polynomials associated with root systems
- scientific article; zbMATH DE number 4146796
- On the roots of orthogonal polynomials and Euler-Frobenius polynomials
- scientific article; zbMATH DE number 4130984
- scientific article; zbMATH DE number 4173314
- scientific article; zbMATH DE number 56689
- The roots of -polynomials
- Orthogonal polynomials
- scientific article; zbMATH DE number 5077674
- Orthogonal polynomials
Cited in
(26)- Optimization via Chebyshev polynomials
- A continuous analogue of the tensor-train decomposition
- Parameter estimation and signal reconstruction
- A note on generalized companion pencils in the monomial basis
- A test, based on conversion to the Bernstein polynomial basis, for an interval to be free of zeros applicable to polynomials in Chebyshev form and to transcendental functions approximated by Chebyshev series
- Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials
- Chebyshev expansion on intervals with branch points with application to the root of Kepler's equation: A Chebyshev-Hermite-Padé method
- Simultaneous confidence bands for all contrasts of three or more simple linear regression models over an interval
- Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach
- Implicit QR for rank-structured matrix pencils
- Stability of rootfinding for barycentric Lagrange interpolants
- Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries
- Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
- Computing real roots of a polynomial in Chebyshev series form through subdivision
- Implicit QR for companion-like pencils
- On the stability of computing polynomial roots via confederate linearizations
- A comparison of companion matrix methods to find roots of a trigonometric polynomial
- Computing the Roots of Complex Orthogonal and Kernel Polynomials
- Scaling properties of queues with time-varying load processes: extensions and applications
- A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters
- Using parity to accelerate Hermite function computations: zeros of truncated Hermite series, Gaussian quadrature and Clenshaw summation
- On generating Sobolev orthogonal polynomials
- A generalized eigenvalue problem for quasi-orthogonal rational functions
- Chebyshev varieties
- Rootfinding for a transcendental equation without a first guess: polynomialization of Kepler's equation through Chebyshev polynomial expansion of the sine
- Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding
This page was built for publication: Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470912)
