powered by
Applies the fixed point algorithm to find x such that ftn(x) == x.
fixedpoint(ftn, x0, tol = 1e-09, max.iter = 100)
Returns the value of x at which ftn(x) == x. If the function fails to converge within max.iter iterations, returns NULL.
the function.
is the initial guess at the fixed point.
distance of successive iterations at which algorithm terminates.
maximum number of iterations.
We assume that ftn is a function of a single variable.
Jones, O.D., R. Maillardet, and A.P. Robinson. 2009. An Introduction to Scientific Programming and Simulation, Using R. Chapman And Hall/CRC.
newtonraphson, bisection
newtonraphson
bisection
ftn1 <- function(x) return(exp(exp(-x))) fixedpoint(ftn1, 2, tol = 1e-6)
Run the code above in your browser using DataLab