Pages that link to "Item:Q2734987"
From MaRDI portal
The following pages link to Newton's method and some complexity aspects of the zero-finding problem (Q2734987):
Displaying 11 items.
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis (Q1338218) (← links)
- Rigid cohomology and \(p\)-adic point counting (Q2388616) (← links)
- Complexity of the Newton method for set-valued maps (Q2926078) (← links)
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201) (← links)
- Finding a Multiple Zero by Transformations and Newton-Like Methods (Q3316469) (← 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)
- The implicit function theorem revisited (Q4320792) (← links)
- A natural language user interface for fuzzy scope queries (Q4456556) (← links)
- Shannon sampling and function reconstruction from point values (Q4813564) (← links)
- Newton iteration, conditioning and zero counting (Q5501607) (← links)
- A Newton’s iteration converges quadratically to nonisolated solutions too (Q6133447) (← links)
