Thread: Maple procedure, solving f(x)=0

I am so useless at Maple and can only do very basic things on it. My lecturer wants us to do this (below) and everyone is struggling and has no idea how to do it. D:

I have spent hours researching how I can do it but I'm getting no where. Could I get some pointers of how to do this please?

Write a Maple procedure that solves the eqn f(x)=0 for an arbitrary function as follows:

1) Apply one iteration of the method of false position
2) If the search interval is not reduced by 50% or more, apply 1 iteration of the bisector method
3) Return to step 2) and repeat

The procedure should take 3 arguments: a function f(x), & the bounds of the initial search interval. Include an instruction to display the number of iterations used by the procedure.

Originally Posted by CourtneyMoon

I am so useless at Maple and can only do very basic things on it. My lecturer wants us to do this (below) and everyone is struggling and has no idea how to do it. D:

I have spent hours researching how I can do it but I'm getting no where. Could I get some pointers of how to do this please?

Write a Maple procedure that solves the eqn f(x)=0 for an arbitrary function as follows:

1) Apply one iteration of the method of false position
2) If the search interval is not reduced by 50% or more, apply 1 iteration of the bisector method
3) Return to step 2) and repeat

The procedure should take 3 arguments: a function f(x), & the bounds of the initial search interval. Include an instruction to display the number of iterations used by the procedure.

The algorithm is independedent of the computational tool. So first define your algorithm in any suitable manner (flow chart, psuedo-code, an itterative procedure...) but make it explicit. Then worry about the details of implementation in LE>

CB