Newton's method (nonfiction): Difference between revisions
Jump to navigation
Jump to search
(Created page with "In numerical analysis, '''Newton's method''' (also known as the '''Newton–Raphson method'''), named after Isaac Newton and Joseph Raphson (no...") |
No edit summary |
||
Line 1: | Line 1: | ||
In numerical analysis, '''Newton's method''' (also known as the '''Newton–Raphson method''') | In [[Numerical analysis (nonfiction)|numerical analysis]], '''Newton's method''' (also known as the '''Newton–Raphson method''') is a method for finding successively better approximations to the roots (or zeroes) of a real-valued function. | ||
It is named after [[Isaac Newton (nonfiction)|Isaac Newton]] and [[Joseph Raphson (nonfiction)|Joseph Raphson]], and is one example of a root-finding algorithm. | |||
== In the News == | == In the News == | ||
<gallery> | <gallery> | ||
</gallery> | </gallery> | ||
Line 20: | Line 18: | ||
* [[Mathematics (nonfiction)]] | * [[Mathematics (nonfiction)]] | ||
* [[Isaac Newton (nonfiction)]] | * [[Isaac Newton (nonfiction)]] | ||
* [[Numerical analysis (nonfiction)]] | |||
* [[Joseph Raphson (nonfiction)]] | * [[Joseph Raphson (nonfiction)]] | ||
Revision as of 13:34, 16 December 2017
In numerical analysis, Newton's method (also known as the Newton–Raphson method) is a method for finding successively better approximations to the roots (or zeroes) of a real-valued function.
It is named after Isaac Newton and Joseph Raphson, and is one example of a root-finding algorithm.
In the News
Fiction cross-reference
Nonfiction cross-reference
- Mathematics (nonfiction)
- Isaac Newton (nonfiction)
- Numerical analysis (nonfiction)
- Joseph Raphson (nonfiction)
External links:
- Number @ Wikipedia