Pages that link to "Item:Q1338218"
From MaRDI portal
The following pages link to On generalized Newton algorithms: Quadratic convergence, path-following and error analysis (Q1338218):
Displayed 15 items.
- Globally convergent, iterative path-following for algebraic equations (Q655158) (← links)
- A fast and stable algorithm for splitting polynomials (Q679271) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- Smale's \(\alpha \)-theory for inexact Newton methods under the \(\gamma \)-condition (Q982563) (← links)
- Some lower bounds for the complexity of continuation methods (Q1279910) (← links)
- Robust certified numerical homotopy tracking (Q1955526) (← links)
- Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds (Q2387418) (← links)
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201) (← links)
- On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case (Q3433761) (← links)
- Multihomogeneous Newton methods (Q4955862) (← links)
- Newton's method for overdetermined systems of equations (Q4955863) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
- On the geometry of Graeffe iteration (Q5949383) (← links)