Purchase Solution

Algorithm for Bisection method

Not what you're looking for?

Ask Custom Question

A continuous function f(x) such that f(a) and f(b) have opposite signs, must have a zero (a point x such that f(x) = 0) in the interval [a, b].

Give a pseudocode for the bisection method algorithm Bise(f(x),a,b,error) for finding an approximation to a zero of a continuous function f(x) in the interval [a, b] accurate to within error.

Purchase this Solution
Solution Summary

The solution briefly explains the working of bisection method before giving the algorithm pseudocode.

Solution Preview

By checking whether f(a) and f((a+b)/2) have opposite signs, we can determine whether a zero occurs in the subinterval [a, (a+b)/2] or in the subinterval [(a+b)/2, b]. The bisection method ...

Purchase this Solution
Free BrainMass Quizzes
Basic Networking Questions

This quiz consists of some basic networking questions.

C# variables and classes

This quiz contains questions about C# classes and variables.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

View More Free Quizzes
Related BrainMass Solutions

  • How many iterations of the Bisection algorithm are necessary to approximate this root

    167216 Bolzano's Theorem : How many iterations of the Bisection algorithm are necessary to approximate this root? Please see the attached file for the fully formatted problem.

  • multiple roots using bisection

    9089 multiple roots using bisection Writing program for Matlab where I find multiple roots using bisection, please see attachment I wrote this program (with a lot of help) that finds multiple roots using bisection.

  • Bisection and newton's method

    This shows how to use the bisection method to find a root and apply Newton's method to the function.

  • Bisection method

    The expert examines the bisection method to solve an equation.

  • Rootfinding and Optimization : Newton's, Secant, Bisection, False Position Methods

    For Newton's Method, use = 3. For the Secant Method, use P0 = 4 and p' = 3. (e) What is your best estimate for p. the location of the maximum? (f) Provide the following two tables, comparing the four algorithms.

  • MATLAB Code Functions

    based on the bisection method (use Wikipedia for details about the method, section 'The method'). The given accuracy is achieved in case |f(c)|< ? , where c- is an approximate root of the equation.

  • Newton-Raphson method - Matlab

    My focus is on the - Bisection method - Regula falsi - Muller's method (if possible) I have seen programs for the above methods on the internet, but I could not see *examples* how to use these programs.

  • Root finding of non-linear equation

    Solve the equation 1+1/[cos(x)*cosh(x)] - ax*[tan(x)-tanh(x)] Using Mueller's method Please see the attached file.

  • MATLAB Code Debugging

    function out=bisect_1(fname, a, b, eps) % bisection algorithm % fname must be a function handle (if you want to use a string instead, % use eval) % sign(fa)*sign(fb) must be negative where fa=feval(fname,a) and % fb=feval(fname,b) %

View More Related Solutions