Rootfinding for a transcendental equation without a first guess: polynomialization of Kepler's equation through Chebyshev polynomial expansion of the sine
Publication:857020
DOI10.1016/J.APNUM.2005.11.010zbMath1105.65054OpenAlexW2081192208WikidataQ61893610 ScholiaQ61893610MaRDI QIDQ857020
Publication date: 14 December 2006
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2005.11.010
celestial mechanicselliptical orbitMatlab implementationtranscendental equationsChebysbev expansions
Computational methods for problems pertaining to mechanics of particles and systems (70-08) Numerical computation of solutions to single equations (65H05) Celestial mechanics (70F15)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Some remarks on multivariate Chebyshev polynomials
- The convergence of Newton-Raphson iteration with Kepler's equation
- Global convergence of Newton's method on an interval
- 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
- The special functions and their approximations. Vol. I, II
- Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
- Numerical Polynomial Algebra
- Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
- Analysis of Some Padé--Chebyshev Approximants
- Rational Chebyshev spectral methods for unbounded solutions on an infinite interval using polynomial-growth special basis functions
This page was built for publication: Rootfinding for a transcendental equation without a first guess: polynomialization of Kepler's equation through Chebyshev polynomial expansion of the sine