MATH116 Lecture Notes - Lecture 4: Tx Network, Recurrence Relation

23 views4 pages

Document Summary

Wednesday, october 28 lecture 18 : newton"s iterative procedure. (refers to section 4. 1 in your text) Students who have mastered the content of this lecture know about: newton"s iterative formula for approximating roots of simple functions. 18. 1 newton"s iterative procedure for finding roots let f : be a continuous function. We sketch the curve of y = f (x). At first glance we can approximate a root x* of y = f (x) by roughly examining where the curve of y = f (x) intersects the x-axis. Say our first approximation of the zero x* is denoted by x1 and we attempt to improve on this approximation. If x1 is reasonably near the root the sequence {xn : n = 1, 2, } of numbers will converge to the root. This method of finding roots is called newton"s iterative procedure.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related textbook solutions

Related Documents

Related Questions