CS110 Chapter Notes - Chapter 4: Linear Interpolation, False Position Method, Cube Root

• School: Southern New Hampshire University
• Department: Computer Science
• Course: CS110
• Professor: David J. Malan

Document Summary

*note that there are several auxiliary functions i. e. helper, floor and pow: cube root, determines cube root of a number, format: double cbrt(double n, division method is used. 2: sum, determines sum of elements of an array of numbers, format 1: double sum1(double* a,size_t n, format 2: double sum2(size_t n,) 4: max, determine the largest element among a set of numbers, format 1: double max1(double* a,size_t n, format 2: double max2(size_t n,, interval search: Iteratively reduce the interval until it converges into an exact value: format: double bisection(double(*f)(double x),double l,double u) 6: false position method, this method is similar to bisection method but converges faster, format: double falseposition(double(*f)(double x),double l,double u, secant method. Iterative method that computes the next point based on linear interpolation: requires two initial points to initialize propagation of iteration, format: double secant(double(*f)(double x),double l,double u) 8: format: double inverseinterp(double(*f)(double x),double l,double u, steffenson"s method.