SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS
From MaRDI portal
Publication:5076167
Cites work
- scientific article; zbMATH DE number 1149491 (Why is no real title available?)
- scientific article; zbMATH DE number 2152307 (Why is no real title available?)
- scientific article; zbMATH DE number 2157777 (Why is no real title available?)
- scientific article; zbMATH DE number 1880582 (Why is no real title available?)
- scientific article; zbMATH DE number 3427740 (Why is no real title available?)
- A near-optimal algorithm for computing real roots of sparse polynomials
- A note on Fibonacci-type polynomials
- Bounds and Majorization Relations for the Zeros of a Class of Fibonacci-Type Polynomials
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Fast and Backward Stable Computation of Roots of Polynomials
- Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials
- Solving secular and polynomial equations: a multiprecision algorithm
- Some results for the zeros of a class of Fibonacci-type polynomials
- The limit of the zero set of polynomials of the Fibonacci type
Cited in
(3)
This page was built for publication: SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076167)