Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach
From MaRDI portal
Publication:2449188
DOI10.1016/j.amc.2012.06.045zbMath1287.42001OpenAlexW1982892514MaRDI QIDQ2449188
Publication date: 7 May 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.06.045
Numerical computation of solutions to single equations (65H05) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Trigonometric polynomials, inequalities, extremal problems (42A05) Numerical methods in Fourier analysis (65T99)
Uses Software
Cites Work
- 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
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials
- A Sinc Function Analogue of Chebfun
- THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
- Introductory Time Series with R
- An Extension of MATLAB to Continuous Functions and Operators
- Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
- Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
- Rational Chebyshev spectral methods for unbounded solutions on an infinite interval using polynomial-growth special basis functions
This page was built for publication: Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach