Determination of the zeros of a linear combination of generalised polynomials
From MaRDI portal
Publication:1200193
DOI10.1016/0377-0427(92)90080-HzbMath0768.65020MaRDI QIDQ1200193
Publication date: 17 January 1993
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
numerical experiments; zeros of a polynomial; implementation; three-term recurrence relation; Horner algorithm; general basis
65H05: Numerical computation of solutions to single equations
Cites Work
- A comparison of methods for terminating polynomial iterations
- On the condition of algebraic equations
- Determination of the Zeros of a Linear Combination of Chebyshev Polynomials
- A stopping criterion for polynomial root finding
- The accuracy of floating point computers
- An Always Convergent Minimization Technique for the Solution of Polynomial Equations
- Practical Problems Arising in the Solution of Polynomial Equations