Computational complexity. On the geometry of polynomials and a theory of cost. I
From MaRDI portal
Publication:3740132
Recommendations
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- scientific article; zbMATH DE number 3976214
- On the cost of computing roots of polynomials
- On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
- scientific article; zbMATH DE number 3880013
Cites work
- scientific article; zbMATH DE number 3134444 (Why is no real title available?)
- scientific article; zbMATH DE number 3161517 (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 3565290 (Why is no real title available?)
- scientific article; zbMATH DE number 3624682 (Why is no real title available?)
- scientific article; zbMATH DE number 3307642 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (Why is no real title available?)
- Coefficients of univalent functions
- The fundamental theorem of algebra and complexity theory
Cited in
(32)- Semialgebraic complexity of functions
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- On rediscovered iteration methods for solving equations
- Approximate Zeros of Quadratically Convergent Algorithms
- Improbability of nonconvergence in a cubic root-finding method
- 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
- Recent developments in information-based complexity
- A short survey on Kantorovich-like theorems for Newton's method
- Problèmes rencontrés dans mon parcours mathématique: Un bilan. (Problems I have come across during my mathematical career: A balance)
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
- A universal constant for the convergence of Newton's method and an application to the classical homotopy method
- On zero finding methods of higher order from data at one point
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- On Schröder's families of root-finding methods
- 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
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- How to be sure of finding a root of a complex polynomial using Newton's method
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Algebraic complexity of computing polynomial zeros
- scientific article; zbMATH DE number 7228894 (Why is no real title available?)
- Newton iteration, conditioning and zero counting
- Fixed point and Newton's methods in the complex plane
- On the cost of computing roots of polynomials
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- A basic family of iteration functions for polynomial root finding and its characterizations
- scientific article; zbMATH DE number 3976214 (Why is no real title available?)
- A study of convergence for a fourth-order two-point iteration in Banach spaces
- An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound
- Polynomial and rational approximations and the link between Schröder's processes of the first and second kind
This page was built for publication: Computational complexity. On the geometry of polynomials and a theory of cost. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740132)