| NewtonRaphson.cpp [code] | This is a demonstration of how to use NewtonRaphson.h This test the algorithm in 3 situations: 1) calculating df at bouth points, to find the average df, for each iteration, with no boundaries 2) calculating d2f to get second order approximation at each iteration, with no boundaries 3) calculating d2f to get second order approximation at each iteration, and a boundary solution |
| NewtonRaphson.h [code] | This is an encapsulation of the one dimensional NewtonRaphson iteration algorithm. It allows for calculating df twice at each iteration, or d2f, to increase the spead of convergance. It also can be used in situations with boundaries. The orignal source cand be viewed or downloaded here |
| NewtonRaphson.mainpage.cpp [code] | This file only contains documentation, it has no code |
1.5.1