Pages that link to "Item:Q5470912"
From MaRDI portal
The following pages link to Roots of Polynomials Expressed in Terms of Orthogonal Polynomials (Q5470912):
Displaying 23 items.
- A comparison of companion matrix methods to find roots of a trigonometric polynomial (Q347776) (← links)
- A generalized eigenvalue problem for quasi-orthogonal rational functions (Q629908) (← links)
- Rootfinding for a transcendental equation without a first guess: polynomialization of Kepler's equation through Chebyshev polynomial expansion of the sine (Q857020) (← links)
- Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding (Q870708) (← links)
- Optimization via Chebyshev polynomials (Q1743371) (← links)
- A continuous analogue of the tensor-train decomposition (Q1987792) (← links)
- Parameter estimation and signal reconstruction (Q2230559) (← links)
- A note on generalized companion pencils in the monomial basis (Q2293107) (← links)
- 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 (Q2372059) (← links)
- Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials (Q2372929) (← links)
- Chebyshev expansion on intervals with branch points with application to the root of Kepler's equation: A Chebyshev-Hermite-Padé method (Q2378246) (← links)
- Simultaneous confidence bands for all contrasts of three or more simple linear regression models over an interval (Q2445598) (← links)
- Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach (Q2449188) (← links)
- Implicit QR for rank-structured matrix pencils (Q2450897) (← links)
- Stability of rootfinding for barycentric Lagrange interpolants (Q2454385) (← links)
- Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries (Q2460590) (← links)
- Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves (Q2489393) (← links)
- Computing real roots of a polynomial in Chebyshev series form through subdivision (Q2499750) (← links)
- Implicit QR for companion-like pencils (Q2796017) (← links)
- SCALING PROPERTIES OF QUEUES WITH TIME-VARYING LOAD PROCESSES: EXTENSIONS AND APPLICATIONS (Q5051218) (← links)
- A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters (Q5270769) (← links)
- Using parity to accelerate Hermite function computations: zeros of truncated Hermite series, Gaussian quadrature and Clenshaw summation (Q6160468) (← links)
- On generating Sobolev orthogonal polynomials (Q6193844) (← links)