### Abstract

The use of implicit formulae in the solution of stiff ODEs gives rise to systems of nonlinear equations which are usually solved iteratively by a modified Newton scheme. The linear algebra costs associated with such schemes may form a substantial part of the overall cost of the solution. The work of W. H. Enright and M. S. Kamel attempts to reduce the cost of the iteration by automatically transforming and partitioning the system. We provide new theoretical justification for this method in the case where the stiff eigenvalues of the Jacobian matrix used in the modified Newton iteration are small in number and well separated from the other eigenvalues. The theory of Y. Saad is introduced and adapted to show that the method uses the projection of the Jacobian onto a Krylov subspace which virtually contains the dominant subspace. This is shown to have favourable consequences. Numerical evidence is provided to support the theory.

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

Pages (from-to) | 1-14 |

Number of pages | 13 |

Journal | IMA Journal of Numerical Analysis |

Volume | 9 |

Issue number | 1 |

DOIs | |

Publication status | Published - Jan 1989 |

### Keywords

- nonlinear equations
- numerical mathematics
- Newton scheme
- Krylov subspace

## Fingerprint Dive into the research topics of 'Analysis of the Enright-Kamel partitioning method for stiff ODEs'. Together they form a unique fingerprint.

## Cite this

Higham, D. J. (1989). Analysis of the Enright-Kamel partitioning method for stiff ODEs.

*IMA Journal of Numerical Analysis*,*9*(1), 1-14. https://doi.org/10.1093/imanum/9.1.1