SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS
From MaRDI portal
Publication:5076167
DOI10.17654/DM028010133zbMath1499.11046OpenAlexW3199588836MaRDI QIDQ5076167
Publication date: 16 May 2022
Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17654/dm028010133
Real polynomials: location of zeros (26C10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Solving secular and polynomial equations: a multiprecision algorithm
- Some results for the zeros of a class of Fibonacci-type polynomials
- Bounds and Majorization Relations for the Zeros of a Class of Fibonacci-Type Polynomials
- A near-optimal algorithm for computing real roots of sparse polynomials
- A Note on Fibonacci-Type Polynomials
- Fast and Backward Stable Computation of Roots of Polynomials
- The limit of the zero set of polynomials of the Fibonacci type
This page was built for publication: SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS