A comparison of companion matrix methods to find roots of a trigonometric polynomial
From MaRDI portal
Publication:347776
DOI10.1016/j.jcp.2013.03.022zbMath1349.65156OpenAlexW2058080140MaRDI QIDQ347776
Publication date: 5 December 2016
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2013.03.022
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical computation of solutions to single equations (65H05) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding
- Large-degree asymptotics and exponential asymptotics for Fourier, Chebyshev and Hermite coefficients and Fourier transforms
- The Durand-Kerner method for trigonometric and exponential polynomials
- The envelope of the error for trigonometric and Chebyshev interpolation
- A companion matrix analogue for orthogonal polynomials
- A note on simultaneous rootfinding for algebraic, exponential, and trigonometric polynomials
- A Bairstow's type method for trigonometric polynomials
- Practical bifurcation and stability analysis: from equilibrium to chaos.
- A Chebyshev polynomial interval-searching method (``Lanczos economization) for solving a nonlinear equation with application to the nonlinear eigenvalue problem
- Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials
- 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
- Finding the Zeros of a Univariate Equation: Proxy Rootfinders, Chebyshev Interpolation, and the Companion Matrix
- THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
- Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
- On the Convergence of Two Methods for the Simultaneous Finding of All Roots of Exponential Equations
- A method of determining all the zeros of a generalized polynomial with respect to an arbitrary Chebyshev system
- Arc-Length Continuation and Multigrid Techniques for Nonlinear Elliptic Eigenvalue Problems
- The Method of Resultants for Computing Real Solutions of Polynomial Systems
- The Condition of Polynomials in Power Form
- Real zero isolation for trigonometric polynomials
- Spectral Methods in MATLAB
- An Extension of MATLAB to Continuous Functions and Operators
- Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
- Numerical Polynomial Algebra
- QR-algebraic method for approximating zeros of system of polynomials
- Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
