Newton's method
From Wiki @ Karl Jones dot com
Revision as of 05:12, 23 April 2016 by Karl Jones (Talk | contribs)
In the mathematical field of numerical analysis, Newton's method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real-valued function.
See also
- Aitken's delta-squared process
- Approximation
- Bisection method
- Euler method
- Fast inverse square root
- Fisher scoring
- Function (mathematics)
- Gradient descent
- Integer square root
- Laguerre's method
- Leonid Kantorovich, who initiated the convergence analysis of Newton's method in Banach spaces.
- Methods of computing square roots
- Newton, Isaac
- Newton's method in optimization
- Numerical analysis
- Raphson, Joseph
- Real number
- Richardson extrapolation
- Root of a function
- Root-finding algorithm
- Secant method
- Steffensen's method
- Subgradient method
External links
- Newton's method @ Wikipedia
