Pages that link to "Item:Q3729924"

The following pages link to Finding polynomial roots: A fast algorithm convergent on the complex plane (Q3729924):

Displaying 11 items.

• The Laguerre-and-sums-of-powers algorithm for the efficient and reliable approximation of all polynomial roots (Q327308) (← links)
• A fitting algorithm for real coefficient polynomial rooting (Q421833) (← links)
• Finding cactus roots in polynomial time (Q726100) (← links)
• Finding roots by deflated polynomial approximation (Q921867) (← links)
• Sorting-based calculation of zeroes and extrema of functions as applied to search and recognition. I (Q1407170) (← links)
• A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm (Q1819535) (← links)
• Quantum algorithm for the root-finding problem (Q2329950) (← links)
• Accelerated approximation of the complex roots of a univariate polynomial (Q2819725) (← links)
• Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm (Q2878836) (← links)
• When Newton meets Descartes (Q5244548) (← links)
• Finding the roots of polynomial equations: An algorithm with linear command (Q5933889) (← links)