Metraipolis › archive › dc_a3cf14946d1c

Newton's method — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Newton%27s_method
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T22:17:03.549Z
SHA-256 of the archived text
2ea4d596ea737385a645f32cd936c1d62d66ac54712dc323cd2a1104e03f8845
Stable URL of this page
https://metraipolis.com/documento/dc_a3cf14946d1c

How to cite

Newton's method — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Newton%27s_method (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a3cf14946d1c (Metraipolis archive dc_a3cf14946d1c, sha256 2ea4d596ea737385a645f32cd936c1d62d66ac54712dc323cd2a1104e03f8845)
BibTeX
@misc{dca3cf14946d1c,
  title = {Newton's method — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Newton%27s_method},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a3cf14946d1c; sha256 2ea4d596ea737385a645f32cd936c1d62d66ac54712dc323cd2a1104e03f8845},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Newton%27s_method. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In numerical analysis, the Newton–Raphson method, also known simply as Newton's method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or zeroes) of a real-valued function. The most basic version starts with a real-valued function f, its derivative f′, and an initial guess x0 for a root of f. If f satisfies certain assumptions and the initial guess is close, then x 1 = x 0 − f ( x 0 ) f ′ ( x 0 ) {\displaystyle x_{1}=x_{0}-{\frac {f(x_{0})}{f'(x_{0})}}} is a better approximation of the root than x0. Geometrically, (x1, 0) is the x-intercept of the tangent to the graph of f at (x0, f(x0)): that is, the improved guess, x1, is the unique root of the linear approximation of f at the initial guess, x0. The process is repeated as x n + 1 = x n − f ( x n ) f ′ ( x n ) {\displaystyle x_{n+1}=x_{n}-{\frac {f(x_{n})}{f'(x_{n})}}} until a sufficiently precise value is reached. The number of correct digits roughly doubles with each step. This algorithm is first in the class of Householder's methods, and was succeeded by Halley's method. The method can also be extended to complex functions and to systems of equations.

Tema degli esploratori: storia e filosofia della scienza (deposito sistematico; ricerca «scientific method»).
Fonte: Wikipedia in inglese, voce «Newton's method» — https://en.wikipedia.org/wiki/Newton%27s_method
Wikidata Q374195 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q374195
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Newton%27s_method?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1377981914, consultata il 2026-10-07T21:57:51.632Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: c89630dbb791a6919ab55cb07ab9be47874272e533785ebf3a6aaa4564751881