Pages that link to "Item:Q4785834"

The following pages link to Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding (Q4785834):

Displaying 30 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)
• Variable-stepsize Chebyshev-type methods for the integration of second-order I.V.P.'s (Q879415) (← links)
• Fast multipole methods for approximating a function from sampling values (Q1681777) (← links)
• New approximations to the principal real-valued branch of the Lambert \(W\)-function (Q1693589) (← links)
• Solving 1D conservation laws using Pontryagin's minimum principle (Q1704773) (← links)
• An integral equation-based numerical solver for Taylor states in toroidal geometries (Q1709020) (← 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)
• 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)
• 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)
• Computing the common zeros of two bivariate functions via Bézout resultants (Q2514244) (← links)
• Barycentric-Remez algorithms for best polynomial approximation in the chebfun system (Q2655225) (← links)
• Numerical instability of resultant methods for multidimensional rootfinding (Q2796860) (← links)
• Robust and Efficient Solution of the Drum Problem via Nyström Approximation of the Fredholm Determinant (Q2945412) (← links)
• Chebfun: A New Kind of Numerical Computing (Q3006919) (← links)
• A polynomial interpolation process at quasi-Chebyshev nodes with the FFT (Q3094285) (← links)
• (Q4600661) (← links)
• Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding (Q5014660) (← links)
• Structure-Preserving Function Approximation via Convex Optimization (Q5132001) (← links)
• Error Localization of Best $L_{1}$ Polynomial Approximants (Q5151924) (← links)
• Calculating the Discrete Spectrum of the Transport Operator with Arbitrary Order Anisotropic Scattering (Q5758149) (← links)
• From matrix polynomial to determinant of block Toeplitz-Hessenberg matrix (Q6076948) (← links)