Pages that link to "Item:Q3904686"
From MaRDI portal
The following pages link to The fundamental theorem of algebra and complexity theory (Q3904686):
Displaying 50 items.
- One-dimensional Coulomb multiparticle systems (Q277675) (← links)
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory (Q289521) (← links)
- Ten misconceptions from the history of analysis and their debunking (Q360440) (← links)
- Some inequalities for polynomials and rational functions associated with lemniscates (Q378648) (← links)
- Markov-type inequality and a lower bound for the moduli of critical values of polynomials (Q382184) (← links)
- Smale's fundamental theorem of algebra reconsidered (Q404254) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- On one extremal problem for complex polynomials with constraints on critical values (Q467659) (← links)
- Smale's mean value conjecture for finite Blaschke products (Q525417) (← links)
- On the solution of systems of equations with constant rank derivatives (Q542442) (← links)
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros (Q548297) (← links)
- Topological complexity of a root finding algorithm (Q582007) (← links)
- The guaranteed convergence of Laguerre-like method (Q597223) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- A continuation method to solve polynomial systems and its complexity (Q621308) (← links)
- Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions (Q639348) (← links)
- On the finite-increment theorem for complex polynomials (Q650329) (← links)
- A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Verified error bounds for singular solutions of nonlinear systems (Q747729) (← links)
- Cayley's problem and Julia sets (Q800109) (← links)
- Critical points and values of complex polynomials (Q804635) (← links)
- Probabilistic analysis of numerical methods for integral equations (Q808674) (← links)
- Shifted varieties and discrete neighborhoods around varieties (Q820939) (← links)
- Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems (Q827005) (← links)
- On the convergence of the sequences of Gerschgorin-like disks (Q857652) (← links)
- Smoothed analysis of complex conic condition numbers (Q864180) (← links)
- Geometric function theory and Smale's mean value conjecture (Q883658) (← links)
- New barriers in complexity theory: on the solvability complexity index and the towers of algorithms (Q889488) (← links)
- Certified predictor-corrector tracking for Newton homotopies (Q898257) (← links)
- The continuous, desingularized Newton method for meromorphic functions (Q914218) (← links)
- Kantorovich's type theorems for systems of equations with constant rank derivatives (Q935772) (← links)
- Smale's \(\alpha \)-theory for inexact Newton methods under the \(\gamma \)-condition (Q982563) (← links)
- Conservative polynomials and yet another action of \(\text{Gal}(\overline{\mathbb Q}/\mathbb Q)\) on plane trees (Q1011978) (← links)
- Kantorovich-type convergence criterion for inexact Newton methods (Q1021628) (← links)
- Global convergence of the method of successive approximations on \(S^ 1\) (Q1059230) (← links)
- Average case optimality (Q1071513) (← links)
- On the existence of generally convergent algorithms (Q1077876) (← links)
- Optimal solution of nonlinear equations (Q1086985) (← links)
- 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 (Q1091081) (← links)
- Finiteness of the set of conservative polynomials of given degree (Q1093032) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- The geometry of ill-conditioning (Q1100848) (← links)
- On the worst-case arithmetic complexity of approximating zeros of polynomials (Q1101184) (← links)
- Complexity theory of numerical linear algebra (Q1103328) (← links)
- Ecology models and Newton vector fields (Q1108963) (← links)
- A probabilistic theory for error estimation in automatic integration (Q1116644) (← links)
- Global aspects of the continuous and discrete Newton method: A case study (Q1118980) (← links)
