Pages that link to "Item:Q1273735"

The following pages link to Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735):

Displaying 23 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)
• Polynomial factorization through Toeplitz matrix computations (Q1874656) (← links)
• Fast computation of contour integrals of rational functions (Q1977145) (← links)
• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
• On the complexity of computing with planar algebraic curves (Q2254683) (← links)
• Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
• Computing Igusa class polynomials (Q2862530) (← links)
• Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation (Q4610020) (← links)
• Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
• Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038) (← links)
• Filtering and smoothing formulas of AR(<i>p</i>)-modulated Poisson processes (Q5086307) (← links)
• Nearly optimal computations with structured matrices (Q5919809) (← links)
• Computing a Hurwitz factorization of a polynomial (Q5928301) (← links)
• On the geometry of Graeffe iteration (Q5949383) (← links)