Pages that link to "Item:Q2489393"
From MaRDI portal
The following pages link to Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves (Q2489393):
Displaying 13 items.
- A comparison of companion matrix methods to find roots of a trigonometric polynomial (Q347776) (← links)
- Numerical, perturbative and Chebyshev inversion of the incomplete elliptic integral of the second kind (Q434656) (← links)
- New series for the cosine lemniscate function and the polynomialization of the lemniscate integral (Q629431) (← 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)
- 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)
- Parallel computation of real solving bivariate polynomial systems by zero-matching method (Q2451343) (← 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 (Q2499750) (← links)
- Computing the common zeros of two bivariate functions via Bézout resultants (Q2514244) (← links)
- (Q4600661) (← links)
- The Computation of Multiple Roots of a Bernstein Basis Polynomial (Q5216781) (← links)
