SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS
From MaRDI portal
Publication:5076167
DOI10.17654/DM028010133zbMATH Open1499.11046OpenAlexW3199588836MaRDI QIDQ5076167FDOQ5076167
Authors: Amal Al-Saket
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
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Real polynomials: location of zeros (26C10)
Cites Work
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Solving secular and polynomial equations: a multiprecision algorithm
- Title not available (Why is that?)
- A note on Fibonacci-type polynomials
- Title not available (Why is that?)
- Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials
- Title not available (Why is that?)
- A near-optimal algorithm for computing real roots of sparse polynomials
- Fast and Backward Stable Computation of Roots of Polynomials
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- The limit of the zero set of polynomials of the Fibonacci type
Cited In (3)
Uses Software
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)