CC18 Topic1 ApplicationofDiffentiation
CC18 Topic1 ApplicationofDiffentiation
Calculus 1-CC18
Topic 1:
Application of Differentiation
[email protected] Nguyễn
Thế Vỹ
2
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
Contents
1 Related Rate 4
1.1 Theory........................................................................................................................4
1.2 Example....................................................................................................................4
4 Intermediate Products 8
4.1 Theory........................................................................................................................8
4.2 Example....................................................................................................................8
5 Optimization Problems 9
6 Newton’s Method 10
6.1 Theory:....................................................................................................................10
6.2 Example:................................................................................................................11
7 Codespace 12
7.1 Chapter 4.1 Ex.72...............................................................................................12
7.2 Chapter 4.2 Ex.13...............................................................................................14
7.3 Chapter 4.2 Ex.14...............................................................................................16
7.4 Chapter 4.4 Ex.66...............................................................................................18
7.5 Chapter 4.7 Ex.50...............................................................................................19
7.6 Chapter 4.7 Ex.65...............................................................................................21
7.7 Chapter 4.8 Ex.32...............................................................................................23
3
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
1 Related Rate
1.1 Theory
In a related rates problem the idea is to compute the rate of change of one
quantity in terms of the rate of change of another quantity (which may be
more easily measured). The procedure is to find an equation that relates
the two quantities and then use the Chain Rule to differentiate both sides
with respect to time.
Related rates and problems involving related rates take advantage of
quantities that are related to each other. Related rates help us
determine how fast or how slow a certain quantity is changing
using the rate of change of the second quantity.
1.2 Example
As time progresses, the water level within the cylinder increases. This also
means that the volume of the water inside will be varying with respect to
time. We can use related rates here if we want to observe the rates of
change of the water level’s height and volume with respect to time.
We can assign h to be the water’s height, so its rate of change will be dh where dt
d
represents t
the change in time, t .
Similarly, if we assign V to be the water’s volume, we can represent the
volume’s rate of change as dV .
d
The two rates,
t
dh
and dV , can then be used to determine unknown values or
d d
quantities. t t
4
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
Definition 2
The number f (c) is a
local maximum value of f if f (c) ≥ f (x) when x is near c.
local minimum value of f if f (c) ≤ f (x) when x is near c.
Fermat’s Theorem
If f has a local maximum or minimum at c, and if f′(c) exists, then f′(c)
= 0.
Definition 5
A critical number of a function f is a number c in the domain of f such
that either
f′(c) = 0 or f′(c) does not exist.
If f has a local maximum or minimum at c, then c is a critical number of f.
5
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
Increasing/Decreasing Test:
If f′(x) > 0 on an interval, then f is increasing on
that interval. If f′(x) < 0 on an interval, then f is
increasing on that interval.
6
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
Concavity Test:
(a) If f ′′(x) > 0 for all x in I , then the graph of f is concave upward on I.
(b) If f ′′(x) < 0 for all x in I , then the graph of f is concave downward
on I.
A point P on a curve y = f (x) is called an Inflection point if f is
continuous there and the curve changes from concave upward to concave
downward or from concave downward to concave upward at P .
7
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
4 Intermediate Products
4.1 Theory
If we have a limit in the form limx→ a f (x)g(x), that is a x → a , f (x)
→ 0 and
g(x) → +∞ or f (x) → +∞ and g(x) → 0.
Then it isn’t clear what the value of limx→ a f (x)g(x)
Then we have a limit of Indeterminate Form of Type 0 × ∞.
4.2 Example
Evaluate the following limit: limx→0 cot 2x · sin 6x
Step 1:As x → 0, cot 2x → ∞ and sin 6x → 0: → Apply L’Hospital’s rule
Step 2: Rewrite the limit:
lim sin 6x
x→0 tan 2x
8
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
5 Optimization Problems
Step in Solving Optimization
problem
Step 2: Draw a diagram
Step 3: Introduce Notation
Step 4: Express Q in terms of some of the other symbols from Step 3
Step 5: Try to express Q with one variable x
Step 6: Find the absolute maximum or minimum value of f
Example:
A farmer has 2400 ft of fencing and wants to fence off a rectangular field
that borders a straight river. He needs no fence along the river. What are
the dimensions of the field that has the largest area?
Step 1: use 2400ft of fence to cover the field to make the largest area.
Step 2: let’s experiment with some special cases
9
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
6 Newton’s Method
6.1 Theory:
Newton’s method is a technique for solving equations of the form f (x) = 0
by successive approximation. The idea is to pick an initial guess x0 such
that f (x0) is reasonably close to 0. We then find the equation of the line
tangent to y = f (x) at x = x0 and follow it back to the x − axis at a new
(and improved!) guess x1. The formula for this is
(x) x1 = xf 0 −
f′(x ) 0
x2 = x1 f(x1)
—
f′(x1)
We keep on refining our guesses until we are close enough for whatever
application we have in mind. In general, we have the recursive formula
x =x
— f (x n )
n+1 n
f′(x n )
10
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
6.2 Example:
In this example we compute, approximately, the square root of two by
applying Newton’s method to the equation: f (x) = x2 − 2 = 0
Since f′(x) = 2x, Newton’s Method says that we should generate
approximate solutions by applying
xn+1 = xn f(xn) = xn+1 = xn xn −
2 1 1
− f′(xn) − 2 = xn + n
2 x
2xn
1 1 1 1
x3 = x2 + = (1.416666667) + = 1.414215686
2 2 2 1.416666667
x
1 1 1 1
x4 = x3 + = (1.414215686) + = 1.414213562
2 3 2 (1.414215686)
x
1 1 1 1
x5 = x4 + = (1.414213562) + = 1.414213562
2 4 2 1.414213562
x
11
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
7 Codespace
7.1 Chapter 4.1 Ex.72
On May 7, 1992, the space shuttle Endeavour was launched on mission
STS-49, the purpose of which was to install a new perigee kick motor in an
Intelsat communications satellite. The table gives the velocity data for the
shuttle between liftoff and the jettisoning of the solid rocket boosters.
12
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
13
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
14
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
15
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
16
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
17
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
2x − 3 (2x+1)
lim ( )
x→∞ 2x + 5
exp(-8)=0.00033546262790251
18
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
19
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
20
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
21
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
22
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
23
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
(b) Solve the equation in part (a) using x1 = 0.6 as the initial approximation.
24
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
(c) Solve the equation in part (a) using x1 = 0.57. (You definitely need a
programmable calculator for this part.);
25
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
(d) Graph f (x) = x3 − x − 1 and its tangent lines at x1 = 1, 0.6, 0.57, to
explain why Newton’s method is so sensitive to the value of the initial
approximation.
26
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering
References
[1]Matlab Online.
[2]Overleaf.
27