### Abstract

This paper studies numerical solution of nonlinear two-point boundary value problems for second order ordinary differential equations. First, it establishes a connection between the finite difference method and the quasi-linearization method. We prove that using finite differences to discretize the sequence of linear differential equations arising from quasi-linearization (Newton method on operator level) leads to the usual iteration formula of the Newton finite difference method. From the provided derivation, it can easily be inferred that such a relation holds also for the Picard and the constant-slope methods. Based on this result, we propose a way of replacing the Newton, Picard, and constant-slope finite difference methods by respective successive application of the linear shooting method. This approach has a number of advantages. It removes the necessity of solving systems of algebraic equations, hence working with matrices, altogether. Compared to the usual finite difference method with general solver, it reduces the number of computational operations from O(N
^{3}
), where N is the number of mesh-points, to only O(N).

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

Pages (from-to) | 46-60 |

Number of pages | 15 |

Journal | Journal of Computational and Applied Mathematics |

Volume | 358 |

DOIs | |

Publication status | Published - Oct 1 2019 |

### Keywords

- Constant-slope
- Finite difference method
- Linear shooting
- Newton
- Picard
- Quasi-linearization

### ASJC Scopus subject areas

- Computational Mathematics
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Replacing the finite difference methods for nonlinear two-point boundary value problems by successive application of the linear shooting method'. Together they form a unique fingerprint.

## Cite this

*Journal of Computational and Applied Mathematics*,

*358*, 46-60. https://doi.org/10.1016/j.cam.2019.03.004