Fast algorithm to find root of strictly decreasing function

  • Thread starter dabd
  • Start date
  • #1
25
0

Main Question or Discussion Point

What is the fastest algorithm to find the closest root (such that the function value at that point is positive to an error but never negative, if not exactly zero) for a strictly decreasing function?
 

Answers and Replies

  • #2
2,967
5
If you can find the derivative of the function, Newton's tangent method, otherwise secant method.
 
  • #3
100
0
What is the fastest algorithm to find the closest root (such that the function value at that point is positive to an error but never negative, if not exactly zero) for a strictly decreasing function?
In the Newton-Raphson Method, you do not need to find the derivative instead

Code:
private static double df(double x) {
		double del=0.000001;
		double x0=f(x+del)-f(x);
		x0=x0/del;
		return x0;
	}
 

Related Threads on Fast algorithm to find root of strictly decreasing function

Replies
1
Views
3K
  • Last Post
Replies
12
Views
913
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
5
Views
2K
Replies
4
Views
656
  • Last Post
Replies
1
Views
2K
Replies
6
Views
953
Replies
12
Views
1K
Top