## Lecture Notes on Elementary Numerical Analysis |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

The Bernoulli method | 2-1 |

The QuotientDifference Algorithm | 3-1 |

Iteration | 4-1 |

7 other sections not shown

### Common terms and phrases

Aitken's Algorithm applied approximate arbitrary assume Bernoulli's method binary fraction binomial coefficients calculate chapter characteristic polynomial complex number computation condition conjugate complex roots constants decimal denote derivative determined difference equation differential equations digits dominant root elements error formula evaluating Example exists expression fixed point arithmetic function f given hence hypotheses identically initial value problem integer interpolating f interpolating points interpolating polynomial interval inverse interpolation iteration Let f linear linearly machine numbers mean value theorem n-th Newton's method nomial numerical differentiation numerical integration obtain points Xq polating poly polynomial interpolating polynomial of degree polynomial p(x problem of finding Q D scheme quadratic convergence quadratic factor quence real numbers recurrence relation replaced result round-off error Runge-Kutta method satisfy solving starting values step h Taylor algorithm tends to zero trapezoidal variable Wronskian yields