Newton's method (nonfiction): Difference between revisions

From Gnomon Chronicles
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'''), named after [[Isaac Newton (nonfiction)|Isaac Newton]] and [[Joseph Raphson (nonfiction)|Joseph Raphson]], is a method for finding successively better approximations to the roots (or zeroes) of a real-valued function.
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 one example of a root-finding algorithm.


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>
File:Hand_holding_up_two_fingers.svg|link=Natural number (nonfiction)|Diagram of hand holding up two fingers is "honored to represent the entire class of [[Natural number (nonfiction)|natural numbers]]."
</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

External links: