The fundamental theorem of algebra and complexity theory
From MaRDI portal
(Redirected from Publication:3904686)
Cites work
- 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
- 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?)
- 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 geometry of the generalized Gauss map
- The Solution of Systems of Piecewise Linear Equations
Cited in
(only showing first 100 items - show all)- Conservative polynomials and yet another action of \(\text{Gal}(\overline{\mathbb Q}/\mathbb Q)\) on plane trees
- Kantorovich-type convergence criterion for inexact Newton methods
- Global convergence of the method of successive approximations on S^ 1
- Average case optimality
- On the existence of generally convergent algorithms
- Optimal solution of nonlinear equations
- 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
- Finiteness of the set of conservative polynomials of given degree
- Algebraic complexity of computing polynomial zeros
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- The geometry of ill-conditioning
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Complexity theory of numerical linear algebra
- Ecology models and Newton vector fields
- A probabilistic theory for error estimation in automatic integration
- Global aspects of the continuous and discrete Newton method: A case study
- Statistical complexity of the power method for Markov chains
- On zero finding methods of higher order from data at one point
- Study of linear information for classes of polynomial equations
- Corrections to Probabilistic analysis of numerical methods for integral equations
- Some computational methods for systems of nonlinear equations and systems of polynomial equations
- On the history of the fundamental theorem of algebra: theory of equations and integral calculus
- The Newton transform: An operational method for constructing integrals of dynamical systems
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- On the convergence of Wang-Zheng's method
- On the complexity of a PL homotopy algorithm for zeros of polynomials
- Uniform convergence of higher order quasi Hermite-Fejér interpolation
- Some remarks on Dvorcuk's root-finding method
- Complexity of Bezout's theorem. V: Polynomial time
- Local and global behavior for algorithms of solving equations
- The theory of Newton's method
- Real computations with fake numbers
- The convergence of a family of parallel zero-finding methods
- A new fourth-order family of simultaneous methods for finding polynomial zeros
- Symmetric functions and root-finding algorithms
- Point estimation of a family of simultaneous zero-finding methods
- Rational functions and pseudo-Newton algorithms
- Convergence analysis of Davidchack and Lai's algorithm for finding periodic orbits
- On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
- A universal constant for the convergence of Newton's method and an application to the classical homotopy method
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Linear programming, complexity theory and elementary functional analysis
- Smale's mean value conjecture and complex dynamics
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis
- Robust certified numerical homotopy tracking
- Computing spectral measures and spectral types
- The invisible hand of Laplace: the role of market structure in price convergence and oscillation
- Parametrized topological complexity of collision-free motion planning in the plane
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
- Critical values of finite Blaschke products
- Dual mean value problem for complex polynomials
- On the dual mean-value conjecture for complex polynomials
- On the infinite-dimensional QR algorithm
- Convergence behavior for Newton-Steffensen's method under \(\gamma\)-condition of second derivative
- The polynomial pivots as initial values for a new root-finding iterative method
- On an efficient simultaneous method for finding polynomial zeros
- Phase transitions in the one-dimensional Coulomb medium
- Average-case complexity without the black swans
- Two-square theorems for infinite matrices on certain fields
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- A posteriori error bound methods for the inclusion of polynomial zeros
- A family of root-finding methods with accelerated convergence
- An efficient higher order family of root finders
- Extremal polynomials in Smale's mean value conjecture
- Uniqueness of the singular points of vector fields on Riemannian manifolds under the -condition
- Convergence of Gauss-Newton's method and uniqueness of the solution
- The average condition number of most tensor rank decomposition problems is infinite
- One-dimensional Coulomb multiparticle systems
- Complexity of an homotopy method at the neighbourhood of a zero
- Specifying attracting cycles for Newton maps of polynomials
- Polynomials versus finite Blaschke products
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale -theory
- An adjoint-based approach for finding invariant solutions of Navier-Stokes equations
- Chebyshev-like root-finding methods with accelerated convergence
- On the average number of steps of the simplex method of linear programming
- On the solvability complexity index, the n-pseudospectrum and approximations of spectra of operators
- Extremal problems for polynomials in the complex plane
- Computational complexity of a piecewise linear homotopy algorithm
- On the cost of computing roots of polynomials
- Plane Autonomous Systems with Rational Vector Fields
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- Invertibility of random fredholm operators
- Smale's problem for critical points on certain two rays
- The probability that a slightly perturbed numerical analysis problem is difficult
- Ten misconceptions from the history of analysis and their debunking
- On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
- On the cost of approximating all roots of a complex polynomial
- Multiple attractors in Newton's method
- On the efficiency of algorithms of analysis
- A New Inequality for Complex-Valued Polynomial Functions
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- Recent developments in information-based complexity
- Some inequalities for polynomials and rational functions associated with lemniscates
- The Probability That a Numerical Analysis Problem is Difficult
- Markov-type inequality and a lower bound for the moduli of critical values of polynomials
- Early Coefficients of the Inverse of a Regular Convex Function
- Smale's fundamental theorem of algebra reconsidered
- Responses to ``Theoretical Mathematics: Toward\\ a cultural synthesis of mathematics and\\ theoretical physics, by A. Jaffe and F. Quinn
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)
