## Numerical Analysis |

### What people are saying - Write a review

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

### Contents

EVALUATION OF POLYNOMIALS 1 | 1 |

INCREASING THE SPEED OF CONVERGENCE OF SEQUENCES 2 1 | 2 |

RICHARDSONS h2EXTRAPOLATION OR DEFERRED APPROACH TO THE LIMIT 3 1 | 3 |

6 other sections not shown

### Common terms and phrases

algorithm applied approximate solution assume asymptotic bounded CM CM coefficients column components consider constant convergence rate corresponding Crank-Nicolson method defined denote derived determined Diagram difference approximations difference equation Dirichlet problem domain of indeterminacy eigenvalues elements elliptic entries equivalent estimate Euler Euler transformation evaluation example finite difference follows formula Frobenius form function Gauss-Seidel Gauss-Seidel method Gaussian elimination given Hence Hessenberg form Hessenberg matrix implicit methods inequalities initial vector integer iterative method lattice lemma linear programming Math matrices H mesh points methods for solving minimization multiplications negative non-negative nonbasic norms number of iterations numerical solution obtain optimum orthogonal parameters partial differential equations Peaceman-Rachford method pivot polynomial procedure rate of convergence satisfy Section semi-iterative method sequence shown SOR method step successive overrelaxation successive overrelaxation iterative symmetric Technique Theorem transformation traveling-salesman problem tri-diagonal Varga variables Wachspress zero