# bisection

bisection, an Octave code which applies the bisection method to seek a root of f(x) over a change-of-sign interval a <= x <= b.

### Languages:

bisection is available in a MATLAB version and an Octave version and an R version.

### Related Data and Programs:

bisection_integer, an Octave code which seeks an integer solution to the equation f(x)=0, using bisection within a user-supplied change of sign interval [a,b].

bisection_rc, an Octave code which seeks a solution to the equation f(x)=0 using bisection within a user-supplied change of sign interval [a,b]. the procedure is written using reverse communication (RC).

fsolve_test, an Octave code which calls fsolve() which seeks the solution x of one or more nonlinear equations f(x)=0.

nonlin_bisect, an Octave code which interactively applies bisection to seek a root of f(x) over a change-of-sign interval a <= x <= b.

nonlin_fixed_point, an Octave code which interactively uses fixed point iteration x=g(x) to seek a zero of a function f(x) given a starting point x0 and a number of iterations it;

nonlin_newton, an Octave code which interactively uses Newton's method to find the zero of a function, given formulas for f(x), f'(x), and a starting point.

nonlin_regula, an Octave code which interactively uses the regula falsi method to seek a zero of a function f(x) within a domain a ≤ x ≤ b;

nonlin_secant, an Octave code which interactively uses the secant method to seek a zero of a function f(x) given two starting estimates a and b.

nonlin_snyder, an Octave code which interactively uses Snyder's variation of the regula falsi method to seek a zero of a function f(x) within a change of sign interval [a,b];

test_zero, an Octave code which implements test problems for the solution of a single nonlinear equation in one variable.

zero, an Octave code which seeks a solution of a scalar nonlinear equation f(x) = 0, by Richard Brent.

zero_rc, an Octave code which seeks solutions of a scalar nonlinear equation f(x) = 0, or a system of nonlinear equations, using reverse communication.

### Source Code:

Last revised on 04 December 2023.