The following pages link to Univariate polynomials (Q2958942):
Displaying 17 items.
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- Parametrization of approximate algebraic curves by lines (Q598227) (← links)
- Approximate parametrization of plane algebraic curves by linear systems of curves (Q631016) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- Algorithms for adaptive factorization of polynomials (Q1314605) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- An adaptive subdivision method for root finding of univariate polynomials (Q1736361) (← links)
- Faster numerical univariate polynomial root-finding by means of subdivision iterations (Q2110240) (← links)
- Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
- Distance bounds of \(\varepsilon\)-points on hypersurfaces (Q2503306) (← links)
- Parametrization of approximate algebraic surfaces by lines (Q2573848) (← links)
- (Q3533259) (← links)
- Polynomial Root-Finding Algorithms and Branched Covers (Q4291566) (← links)
- (Q4789203) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
- A new fast root-finder for black box polynomials (Q6658315) (← links)
