Pages that link to "Item:Q5880723"
From MaRDI portal
The following pages link to ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS (Q5880723):
Displaying 10 items.
- Finding cactus roots in polynomial time (Q726100) (← links)
- On a family of iterative methods for simultaneous extraction of all roots of algebraic polynomial (Q1763292) (← links)
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently (Q2357369) (← links)
- A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity (Q3566648) (← links)
- Finding polynomial roots: A fast algorithm convergent on the complex plane (Q3729924) (← links)
- Efficient parallel rooting of complex polynomials on the unit circle (Q3987283) (← links)
- (Q4209118) (← links)
- (Q4438131) (← links)
- Fast and Backward Stable Computation of Roots of Polynomials (Q5265003) (← links)
- ON EFFICIENT FRACTIONAL CAPUTO-TYPE SIMULTANEOUS SCHEME FOR FINDING ALL ROOTS OF POLYNOMIAL EQUATIONS WITH BIOMEDICAL ENGINEERING APPLICATIONS (Q6114669) (← links)
