Pages that link to "Item:Q1273735"
From MaRDI portal
The following pages link to Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735):
Displaying 11 items.
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- Transformations of matrix structures work again (Q471925) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Globally convergent, iterative path-following for algebraic equations (Q655158) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- On the geometry of Graeffe iteration (Q5949383) (← links)
