### Abstract

The analysis of immobilized enzyme reactions leads to a two-point boundary value problem that requires numerical solutions based on root-finding methods. The standard Newton-Raphson (N-R) algorithm is adequate if the root-finding is initiated close to the true solution; in other cases, large numbers of iterations may be needed before the algorithm converges. An alternative is a root-finding method based on the theory of S-systems. This method turns out to be much more robust and efficient than the N-R algorithm. It converges quadratically, with fewer iterations, and in a wider range of relevant initial values. An investigation of a simpler algebraic equation with a similar mathematical structure demonstrates that the rate of convergence in the S-system method is not very sensitive to the distance between the root and initial value, whereas convergence of the N-R algorithm slows down drastically with increasing distance.

Original language | English |
---|---|

Pages (from-to) | 289-310 |

Number of pages | 22 |

Journal | Applied Mathematics and Computation |

Volume | 127 |

Issue number | 2-3 |

DOIs | |

Publication status | Published - Apr 15 2002 |

Externally published | Yes |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computational Mathematics
- Applied Mathematics