Displaying 1 result from an estimated 1 matches for "findzero".
2008 Aug 07
1
recursive root finding
...each side of
them). I've used locator() or a guesstimate of the disjoints intervals
to look for solutions, but I would like to get rid off this
unnecessary user input and have a robust way of finding a predefined
number of solutions in the total interval. Something along the lines of:
findZeros <- function( f , numberOfZeros = 3, exclusionInterval =
c(0.1 , 0.2, 0.1)
{
#
# while (number of solutions found is less than numberOfZeros)
# search for a root of f in the union of intervals excluding a
neighborhood of the solutions already found (exclusionInterval)
#
}
I could then apply...