Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
From MaRDI portal
Publication:3028211
Recommendations
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Algebraic complexity of computing polynomial zeros
- Newton's method and some complexity aspects of the zero-finding problem
- scientific article; zbMATH DE number 4032923
Cited in
(41)- Geometric function theory and Smale's mean value conjecture
- Semialgebraic complexity of functions
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- Complexity and algorithms for nonlinear optimization problems
- Critical points and values of complex polynomials
- On critical values of polynomials with real critical points
- scientific article; zbMATH DE number 4032923 (Why is no real title available?)
- Approximate Zeros of Quadratically Convergent Algorithms
- Extremal problems in geometric function theory
- Flow box decomposition for gradients of univariate polynomials, billiards on the Riemann sphere, tree-like configurations of vanishing cycles for \(A_{n}\) curve singularities and geometric cluster monodromy
- Smale's problem for critical points on certain two rays
- Recent developments in information-based complexity
- A short survey on Kantorovich-like theorems for Newton's method
- Newton's method and the computational complexity of the fundamental theorem of algebra
- On zero finding methods of higher order from data at one point
- On the average number of steps of the simplex method of linear programming
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Geometry of polynomials and root-finding via path-lifting
- Topological complexity of a root finding algorithm
- Dual mean value problem for complex polynomials
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Kronecker's and Newton's approaches to solving: a first comparison
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- On the efficient global dynamics of Newton’s method for complex polynomials
- Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- Optimal solution of nonlinear equations
- A probabilistic theory for error estimation in automatic integration
- How to be sure of finding a root of a complex polynomial using Newton's method
- Complexity of Bezout's theorem. V: Polynomial time
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- On the efficiency of algorithms of analysis
- Algebraic complexity of computing polynomial zeros
- Globally convergent, iterative path-following for algebraic equations
- Average case optimality
- Statistical complexity of the power method for Markov chains
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- Smale’s mean value conjecture and the coefficients of univalent functions
- On the cost of approximating all roots of a complex polynomial
- Smale's mean value conjecture for finite Blaschke products
This page was built for publication: Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028211)
