Pages that link to "Item:Q3740132"
From MaRDI portal
The following pages link to Computational complexity. On the geometry of polynomials and a theory of cost. I (Q3740132):
Displaying 30 items.
- Problèmes rencontrés dans mon parcours mathématique: Un bilan. (Problems I have come across during my mathematical career: A balance) (Q921671) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- Improbability of nonconvergence in a cubic root-finding method (Q1107954) (← links)
- On zero finding methods of higher order from data at one point (Q1122311) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- On rediscovered iteration methods for solving equations (Q1300719) (← links)
- A basic family of iteration functions for polynomial root finding and its characterizations (Q1360168) (← links)
- Polynomial and rational approximations and the link between Schröder's processes of the first and second kind (Q1724814) (← links)
- Semialgebraic complexity of functions (Q1763427) (← links)
- Fixed point and Newton's methods in the complex plane (Q1785621) (← links)
- A universal constant for the convergence of Newton's method and an application to the classical homotopy method (Q1895870) (← links)
- A study of convergence for a fourth-order two-point iteration in Banach spaces (Q1975396) (← links)
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems (Q2163445) (← links)
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II. (Q2372910) (← links)
- On Schröder's families of root-finding methods (Q2654184) (← links)
- (Q3305205) (← links)
- On the cost of computing roots of polynomials (Q3330394) (← links)
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial (Q3477120) (← links)
- Recent developments in information-based complexity (Q3780359) (← links)
- Approximate Zeros of Quadratically Convergent Algorithms (Q4305971) (← links)
- An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound (Q4654024) (← links)
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems (Q5207445) (← links)
- A short survey on Kantorovich (Q5270188) (← links)
- How to be sure of finding a root of a complex polynomial using Newton's method (Q5285715) (← links)
- Newton iteration, conditioning and zero counting (Q5501607) (← links)
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications (Q5928297) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
- Point estimation of simultaneous methods for solving polynomial equations: A survey (Q5948584) (← links)
- 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 (Q6150001) (← links)
