Pages that link to "Item:Q4157394"

The following pages link to A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane (Q4157394):

Displaying 24 items.

• Continuous amortization and extensions: with applications to bisection-based root isolation (Q277222) (← links)
• Root isolation of zero-dimensional polynomial systems with linear univariate representation (Q420751) (← links)
• A geometric algorithm for winding number computation with complexity analysis (Q423881) (← links)
• Global root bracketing method with adaptive mesh refinement (Q668161) (← links)
• Singular points of algebraic curves (Q912938) (← links)
• Locating multiple zeros interactively (Q1067359) (← links)
• Some parallel methods for polynomial root-finding (Q1091080) (← links)
• A parallel Wilf algorithm for complex zeros of a polynomial (Q1156457) (← links)
• Computational complexity of real functions (Q1171056) (← links)
• An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences (Q1570128) (← links)
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
• Computing the irreducible real factors and components of an algebraic curve (Q1814128) (← links)
• An algorithm for locating all zeros of a real polynomial (Q1893153) (← links)
• Modified Newton method in circular interval arithmetic (Q1904962) (← links)
• Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
• How to count the number of zeros that a polynomial has on the unit circle? (Q2222071) (← links)
• Evaluating winding numbers and counting complex roots through Cauchy indices in Isabelle/HOL (Q2303242) (← links)
• Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions (Q2576275) (← links)
• Introducing phase jump tracking -- a fast method for eigenvalue evaluation of the direct Zakharov-Shabat problem (Q2656070) (← links)
• (Q2787257) (← links)
• Transport Map Accelerated Markov Chain Monte Carlo (Q3176240) (← links)
• The multivariate bisection algorithm (Q5227502) (← links)
• RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS (Q5314399) (← links)
• Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107) (← links)