The fundamental theorem of algebra and complexity theory
From MaRDI portal
Publication:3904686
Cites work
- scientific article; zbMATH DE number 5968600 (Why is no real title available?)
- scientific article; zbMATH DE number 3121940 (Why is no real title available?)
- scientific article; zbMATH DE number 3134444 (Why is no real title available?)
- scientific article; zbMATH DE number 3136822 (Why is no real title available?)
- scientific article; zbMATH DE number 3143833 (Why is no real title available?)
- scientific article; zbMATH DE number 3167270 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3487169 (Why is no real title available?)
- scientific article; zbMATH DE number 3500711 (Why is no real title available?)
- scientific article; zbMATH DE number 3513716 (Why is no real title available?)
- scientific article; zbMATH DE number 3521895 (Why is no real title available?)
- scientific article; zbMATH DE number 3533716 (Why is no real title available?)
- scientific article; zbMATH DE number 3565290 (Why is no real title available?)
- scientific article; zbMATH DE number 3633694 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 3260031 (Why is no real title available?)
- scientific article; zbMATH DE number 3307642 (Why is no real title available?)
- scientific article; zbMATH DE number 3417832 (Why is no real title available?)
- scientific article; zbMATH DE number 3058859 (Why is no real title available?)
- A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
- A convergent process of price adjustment and global Newton methods
- Complex differential and integral geometry and curvature integrals associated to singularities of complex analytic varieties
- On Algorithms for Solvingf(x)=0
- On local Pareto Optima
- On the Volume of Tubes
- Shorter Notes: A Proof of the Nonretractibility of a Cell Onto its Boundary
- The Solution of Systems of Piecewise Linear Equations
- The geometry of the generalized Gauss map
Cited in
(only showing first 100 items - show all)- Average case optimality
- On the efficiency of algorithms of analysis
- Smale's mean value conjecture and complex dynamics
- On one extremal problem for complex polynomials with constraints on critical values
- Newton's method and the computational complexity of the fundamental theorem of algebra
- Geometric function theory and Smale's mean value conjecture
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- An adjoint-based approach for finding invariant solutions of Navier-Stokes equations
- Convergence of Gauss-Newton's method and uniqueness of the solution
- On the history of the fundamental theorem of algebra: theory of equations and integral calculus
- Deformation techniques to solve generalised Pham systems
- On zero finding methods of higher order from data at one point
- Smoothed analysis of complex conic condition numbers
- Kantorovich's type theorems for systems of equations with constant rank derivatives
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- Chebyshev-like root-finding methods with accelerated convergence
- Cayley's problem and Julia sets
- The probability that a slightly perturbed numerical analysis problem is difficult
- Newton's Method for Underdetermined Systems of Equations Under the γ-Condition
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- One-dimensional Coulomb multiparticle systems
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros
- Smale's mean value conjecture for odd polynomials
- Optimal solution of nonlinear equations
- The Probability That a Numerical Analysis Problem is Difficult
- Approximate Zeros of Quadratically Convergent Algorithms
- Kronecker's and Newton's approaches to solving: a first comparison
- On the solvability complexity index, the \(n\)-pseudospectrum and approximations of spectra of operators
- The geometry of ill-conditioning
- An efficient higher order family of root finders
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- Statistical complexity of the power method for Markov chains
- Smale’s mean value conjecture and the coefficients of univalent functions
- Smale's fundamental theorem of algebra reconsidered
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis
- A general approach to isolating roots of a bitstream polynomial
- On the average number of steps of the simplex method of linear programming
- Multiple attractors in Newton's method
- Ten misconceptions from the history of analysis and their debunking
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Markov-type inequality and a lower bound for the moduli of critical values of polynomials
- Certified predictor-corrector tracking for Newton homotopies
- Complexity theory of numerical linear algebra
- Smale's problem for critical points on certain two rays
- Conservative polynomials and yet another action of \(\text{Gal}(\overline{\mathbb Q}/\mathbb Q)\) on plane trees
- Linear programming, complexity theory and elementary functional analysis
- Robust certified numerical homotopy tracking
- Complexity of Bezout's theorem. V: Polynomial time
- Numerical computation of polynomial zeros by means of Aberth's method
- Uniqueness of the singular points of vector fields on Riemannian manifolds under the \(\gamma\)-condition
- On a cubically convergent derivative-free root finding method
- Critical points and values of complex polynomials
- Early Coefficients of the Inverse of a Regular Convex Function
- How to be sure of finding a root of a complex polynomial using Newton's method
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Local and global behavior for algorithms of solving equations
- Some inequalities for polynomials and rational functions associated with lemniscates
- Verified error bounds for singular solutions of nonlinear systems
- New barriers in complexity theory: on the solvability complexity index and the towers of algorithms
- On critical values of polynomials with real critical points
- On the solution of systems of equations with constant rank derivatives
- A posteriori error bound methods for the inclusion of polynomial zeros
- A Gröbner free alternative for polynomial system solving
- Smale's mean value conjecture for finite Blaschke products
- Real computations with fake numbers
- On the volume of tubular neighborhoods of real algebraic varieties
- Kantorovich-type convergence criterion for inexact Newton methods
- Phase transitions in the one-dimensional Coulomb medium
- Dual mean value problem for complex polynomials
- Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions
- On the finite-increment theorem for complex polynomials
- Extremal polynomials in Smale's mean value conjecture
- Smale's \(\alpha \)-theory for inexact Newton methods under the \(\gamma \)-condition
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory
- The theory of Newton's method
- Polynomials versus finite Blaschke products
- A continuation method to solve polynomial systems and its complexity
- The guaranteed convergence of Laguerre-like method
- Recent development in computational complexity characterization of Nash equilibrium
- Topological complexity of a root finding algorithm
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
- On the infinite-dimensional QR algorithm
- Global convergence of the method of successive approximations on \(S^ 1\)
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- On the cost of computing roots of polynomials
- Convergence behavior for Newton-Steffensen's method under \(\gamma\)-condition of second derivative
- On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems
- A short survey on Kantorovich-like theorems for Newton's method
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- Shifted varieties and discrete neighborhoods around varieties
- Some computational methods for systems of nonlinear equations and systems of polynomial equations
- Invertibility of random fredholm operators
- Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
- The Newton transform: An operational method for constructing integrals of dynamical systems
- On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
- Reshaping the metaphor of proof
- Convergence analysis of Davidchack and Lai's algorithm for finding periodic orbits
- Corrections to Probabilistic analysis of numerical methods for integral equations
This page was built for publication: The fundamental theorem of algebra and complexity theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3904686)
