Skip to main content
. Author manuscript; available in PMC: 2014 May 23.
Published in final edited form as: J Pharmacokinet Pharmacodyn. 2012 Aug 29;39(5):543–560. doi: 10.1007/s10928-012-9267-z

Fig. 3.

Fig. 3

A flow chart illustrating the bisection algorithm for solving equation f(z) = 0. The START and STOP steps denote the beginning and end of the algorithm, respectively. The rectangular boxes represent the assignment steps whereas the diagonal boxes refer to conditional statement with two possible outcomes Yes (if condition is true), and No (if condition is false). The arrows indicate the next steps. The meanings of the symbols aA, aB, acc, and Nmax are explained in the methods and results.