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)- Real computations with fake numbers
- Geometric function theory and Smale's mean value conjecture
- Shifted varieties and discrete neighborhoods around varieties
- Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
- A general approach to isolating roots of a bitstream polynomial
- Complexity theory of numerical linear algebra
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- Finiteness of the set of conservative polynomials of given degree
- On the infinite-dimensional QR algorithm
- Smale's fundamental theorem of algebra reconsidered
- An adjoint-based approach for finding invariant solutions of Navier-Stokes equations
- Critical points and values of complex polynomials
- The Probability That a Numerical Analysis Problem is Difficult
- On the history of the fundamental theorem of algebra: theory of equations and integral calculus
- 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
- Plane Autonomous Systems with Rational Vector Fields
- Some inequalities for polynomials and rational functions associated with lemniscates
- On critical values of polynomials with real critical points
- A continuation method to solve polynomial systems and its complexity
- On the computation of geometric features of spectra of linear operators on Hilbert spaces
- Specifying attracting cycles for Newton maps of polynomials
- Some remarks on Dvorcuk's root-finding method
- Approximate Zeros of Quadratically Convergent Algorithms
- Cayley's problem and Julia sets
- Integrability of matrices
- Ecology models and Newton vector fields
- Extremal problems for polynomials in the complex plane
- A New Inequality for Complex-Valued Polynomial Functions
- Invertibility of random fredholm operators
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- Dual Smale's mean value conjecture
- Extremal problems in geometric function theory
- One-dimensional Coulomb multiparticle systems
- Smale's problem for critical points on certain two rays
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros
- On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
- Reshaping the metaphor of proof
- Polynomials versus finite Blaschke products
- Convergence behavior for Newton-Steffensen's method under \(\gamma\)-condition of second derivative
- Recent developments in information-based complexity
- Dynamics of singular complex analytic vector fields with essential singularities. I
- On the convergence of the sequences of Gerschgorin-like disks
- A short survey on Kantorovich-like theorems for Newton's method
- Multiscale analysis of accelerated gradient methods
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
- A Gröbner free alternative for polynomial system solving
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale -theory
- Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions
- Newton's method and the computational complexity of the fundamental theorem of algebra
- Smale's mean value conjecture and complex dynamics
- Convergence analysis of Davidchack and Lai's algorithm for finding periodic orbits
- Average-case complexity without the black swans
- A universal constant for the convergence of Newton's method and an application to the classical homotopy method
- Newton's Method for Underdetermined Systems of Equations Under the γ-Condition
- On zero finding methods of higher order from data at one point
- Computing spectral measures and spectral types
- A family of root-finding methods with accelerated convergence
- 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]}\)
- The Newton transform: An operational method for constructing integrals of dynamical systems
- Geometry of polynomials and root-finding via path-lifting
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial
- On the solution of systems of equations with constant rank derivatives
- The guaranteed convergence of Laguerre-like method
- Topological complexity of a root finding algorithm
- Uniqueness of the singular points of vector fields on Riemannian manifolds under the \(\gamma\)-condition
- Dual mean value problem for complex polynomials
- On a cubically convergent derivative-free root finding method
- The convergence of a family of parallel zero-finding methods
- On the convergence of Wang-Zheng's method
- Smoothed analysis of complex conic condition numbers
- Density estimates on composite polynomials
- Letter to the editor
- Two-square theorems for infinite matrices on certain fields
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- The probability that a slightly perturbed numerical analysis problem is difficult
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Complexity of an homotopy method at the neighbourhood of a zero
- Extremal polynomials in Smale's mean value conjecture
- Kronecker's and Newton's approaches to solving: a first comparison
- Symmetric functions and root-finding algorithms
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- Kantorovich-type convergence criterion for inexact Newton methods
- Recent development in computational complexity characterization of Nash equilibrium
- Mean value conjectures for rational maps
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis
- The foundations of spectral computations via the solvability complexity index hierarchy
- On the complexity of a PL homotopy algorithm for zeros of polynomials
- Local and global behavior for algorithms of solving equations
- On one extremal problem for complex polynomials with constraints on critical values
- Computing eigenvalues of the Laplacian on rough domains
- A posteriori error bound methods for the inclusion of polynomial zeros
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- Probabilistic analysis of numerical methods for integral equations
- Point estimation of a family of simultaneous zero-finding methods
- On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- The continuous, desingularized Newton method for meromorphic functions
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)
