Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding
From MaRDI portal
Publication:870708
DOI10.1007/s10665-006-9087-5zbMath1110.65037OpenAlexW2067510467MaRDI QIDQ870708
Publication date: 14 March 2007
Published in: Journal of Engineering Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10665-006-9087-5
spherical harmonicsFourier seriesChebyshev seriestrigonometric polynomialspectral seriescompanion-matrix methods
Numerical interpolation (65D05) Numerical computation of solutions to single equations (65H05) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items
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, Characterization of local optima of polynomial modulus over a disc, Rootfinding through global Newton iteration and Chebyshev polynomials for the amplitude of an electronic oscillator, A comparison of companion matrix methods to find roots of a trigonometric polynomial, Numerical evaluation of oscillatory integrals via automated steepest descent contour deformation, Tracking amplitude extrema of nonlinear frequency responses using the harmonic balance method, New series for the cosine lemniscate function and the polynomialization of the lemniscate integral, Higher-Order Accurate Meshing of Implicitly Defined Tangential and Transversal Intersection Curves, Numerical, perturbative and Chebyshev inversion of the incomplete elliptic integral of the second kind, Higher-order accurate meshing of nonsmooth implicitly defined surfaces and intersection curves, The relationships between Chebyshev, Legendre and Jacobi polynomials: the generic superiority of Chebyshev polynomials and three important exceptions, Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach, Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries, A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A method for numerical integration on an automatic computer
- Rootfinding for a transcendental equation without a first guess: polynomialization of Kepler's equation through Chebyshev polynomial expansion of the sine
- A pseudospectral method for two-point boundary value problems
- The Durand-Kerner method for trigonometric and exponential polynomials
- A unified approach to method for the simultaneous computation of all zeros of generalized polynomials
- Trigonometric polynomials with simple roots
- A companion matrix analogue for orthogonal polynomials
- On some interval methods for algebraic, exponential and trigonometric polynomials
- A note on simultaneous rootfinding for algebraic, exponential, and trigonometric polynomials
- On a class of higher order methods for simultaneous rootfinding of generalized polynomials
- Pseudozeros of polynomials and pseudospectra of companion matrices
- A Chebyshev polynomial interval-searching method (``Lanczos economization) for solving a nonlinear equation with application to the nonlinear eigenvalue problem
- 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
- Balancing a matrix for calculation of eigenvalues and eigenvectors
- Die Lage der Nullstellen eines Polynoms
- Die Lage der Nullstellen eines Polynoms. IV
- Average-Case Stability of Gaussian Elimination
- On the Convergence of Two Methods for the Simultaneous Finding of All Roots of Exponential Equations
- Real zero isolation for trigonometric polynomials
- Solving Polynomials with Small Leading Coefficients
- An Extension of MATLAB to Continuous Functions and Operators
- Methods for the simultaneous approximate derivation of the roots of algebraic, trigonometric and exponential equations
- Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
- Numerical Polynomial Algebra
- Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
- Remarks on the Clenshaw-Curtis Quadrature Scheme
