Computing Methods, Volume 1Computing Methods, Volume I generalizes and details the methods involved in computer mathematics. The book has been developed in two volumes; Volume I contains Chapters 1 to 5, and Volume II encompasses Chapters 6 to 10. |
Contents
CHAPTER | 1 |
Iterative Methods of Solving Algebraic and Transcendental | 4 |
The Method of Steepest Descent | 11 |
Copyright | |
64 other sections not shown
Other editions - View all
Common terms and phrases
absolute error accuracy arbitrary arguments assume best approximation calculate called Chapter Chebyshev coefficients column combinations computing Consequently consider constant continuous converges correct defined denote derivative determinant differentiation digits divided differences elements equal equation error estimate exact example expression f(xo fact finite function f(x Gauss give given hand Hence inequality integral interpolation formula interpolation polynomial interval Lagrange least less limits linear maximum means measurement method multipliers necessary Newton numerical integration formulae obtain operations performed places points polynomial of degree possible practice problem produce properties prove quantity relative residual term result roots rounding satisfies seen side solve space substitute Suppose theorem values vanish whilst written x₁ Y₁ zero