Approximate Zeros of Quadratically Convergent Algorithms (Q4305971): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On zero finding methods of higher order from data at one point / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational complexity. On the geometry of polynomials and a theory of cost. I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: <i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The fundamental theorem of algebra and complexity theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the efficiency of algorithms of analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a theorem of S. Smale about Newton's method for analytic mappings / rank | |||
Normal rank | |||
Latest revision as of 17:53, 22 May 2024
scientific article; zbMATH DE number 639637
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate Zeros of Quadratically Convergent Algorithms |
scientific article; zbMATH DE number 639637 |
Statements
15 September 1994
0 references
zeros of holomorphic functions
0 references
efficiency
0 references
complexity
0 references
quadratic convergence
0 references
Newton's method
0 references
iterative algorithm
0 references
Approximate Zeros of Quadratically Convergent Algorithms (English)
0 references
0 references
