Your assignment this week is to write a routine (actually, several functions) which finds the root of a function. For example, suppose the function is
y = sqrt(x) - 3.8You will need to write a MATLAB routine which evaluates this function repeatedly, and takes some action based on the results. But how do to that?
One way would be to hardwire the function into your routine, like this:
% set the bounds of the interval starting_x = 0; ending_x = 10; % now evaluate the function in the middle of the interval mid_x = (starting_x + ending_x) / 2; y = sqrt(mid_x) - 3.8; % take the appropriate action ...But such a routine will work ONLY for the function sqrt(x) - 3.8. If you need to find the roots of a different function, like cos(x) - sqrt(x), then you need to edit your routine and change the line at which y is calculated.
Editing source code every time you need to run a routine in a slightly different way is poor programming style. It's much better to find a way to leave the source code as-is, and act upon some input supplied by the user.
So, it would be nice if we could just call an arbitrary function in the root-finding routine, like this:
% set the bounds of the interval starting_x = 0; ending_x = 10; % now evaluate the function in the middle of the interval mid_x = (starting_x + ending_x) / 2; y = call_the_function_I_want(mid_x); % take the appropriate action ...So, in order to find the root of sqrt(x) - 3.8, one would somehow write
call_the_function_I_want(x) means sqrt(x) - 3.8and to find the root of cos(x) - sqrt(x), somehow tell MATLAB that now
call_the_function_I_want(x) means cos(x) - sqrt(x)
There is a way to do this! The builtin MATLAB routine feval will call a function for you, and it will even supply the appropriate arguments to the function. All you have to do is to provide it with
Suppose we know we'll have to find the roots of three different functions:
function y = quadratic_function(x) y = x*x - 4*x + 3;
function y = cubic_function(x) y = 12*x*x*x + x*x - 4*x + 3;
function y = trig_function(x) y = sin(x)*cos(x) - sin(x)*sin(x);
We create a general root-finding program -- perhaps it uses the bisection method. We design this program so that it take 3 arguments: the starting and ending points of the interval on which to seek a root, and the name of the function whose root we're seeking.
function y = root_finder(starting_x, ending_x, routine_to_root)
Inside this program is a loop, which iterates to get closer and closer to the true root. It contains a section which looks something like this:
% find the middle of the interval mid_x = (starting_x + ending_x) / 2; % and evaluate the function at that point y = feval(routine_to_root, mid_x); % take the appropriate action ...
Now, suppose we are interested in the interval from 0 to 25. To look for a root of the quadratic function, we would type into the MATLAB command window
>> root_finder(0, 25, 'quadratic_function')
To find the root of the cubic function,
>> root_finder(0, 25, 'cubic_function')
To find the root of the trigonometric function,
>> root_finder(0, 25, 'cubic_function')
We can even look for roots of existing, built-in functions:
>> root_finder(0, 25, 'sqrt')or
>> root_finder(0, 25, 'sin')
You should be able to call calculate like this:
calculate('cube', 5.5) calculate('square', 10) calculate('plusone', -33.3)What is the result of each?
Here are my versions of these programs:
Last modified 3/23/2001 by MWR.