arXiv (All)
open access
On Some Applications to the Newton--Raphson Method
Newton's method is classically viewed as an iterative procedure for approximating a zero of a nonlinear function. In this paper, we consider the Newton iterates from a quadrature perspective: the iterates generate a partition of the interval between the initial point and the root, which in turn indu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Error Estimates for the Arnoldi Approximation of a Matrix Square Root#1142545
- The Geometric Function Atlas: A Software System for Radius and Coefficient Problems#616842
- The Geometric Function Atlas: A Software System for Radius and Coefficient Problems#616342
- Square Root Gauss-Newton iLQR#1035023
- Error indicators and adaptivity for a least-squares method applied to the Monge-Ampère equation#1141427
Record · ID 1011941
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive