Pages that link to "Item:Q4291566"
From MaRDI portal
The following pages link to Polynomial Root-Finding Algorithms and Branched Covers (Q4291566):
Displaying 16 items.
- On root finding algorithms for complex functions with branch cuts (Q345951) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Topological complexity of a root finding algorithm (Q582007) (← links)
- Globally convergent, iterative path-following for algebraic equations (Q655158) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Finding cactus roots in polynomial time (Q726100) (← links)
- Groebner basis methods for multichannel sampling with unknown offsets (Q952393) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- Finding a cluster of zeros of univariate polynomials (Q1594831) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks (Q1945444) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- A note on the finite variance of the averaging function for polynomial system solving (Q2269908) (← links)
- (Q3533259) (← links)
- Geometry of polynomials and root-finding via path-lifting (Q4606640) (← links)
- Quadrature by two expansions for evaluating Helmholtz layer potentials (Q6159241) (← links)
