The Newton-Raphson method, usually called Newton's method, is a root-finding algorithm that produces successively better approximations to the zeroes of a real-valued function, given the function, its derivative, and an initial guess, by repeatedly following the function's tangent line to a new, closer estimate. It is named after Isaac Newton and Joseph Raphson: the foundational idea appears in Newton's own writings from 1669 to 1671, but the iterative formula in its modern form was developed by Raphson, with further contributions from Thomas Simpson and later Arthur Cayley. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Credited ToIsaac Newton (1669 to 1671 foundational idea) and Joseph Raphson (modern iterative form), with later contributions from Thomas Simpson and Arthur Cayley. 1 Sources
1. Wikipedia: Newton-Raphson Method
Wikimedia FoundationLead section
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.
Body, history
the foundational work appeared in Newton's writings from 1669-1671, though the modern formulation was developed by Joseph Raphson and Thomas Simpson, with further refinements by others including Simpson and Arthur Cayley
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.