0% found this document useful (0 votes)
9 views27 pages

CC18 Topic1 ApplicationofDiffentiation

The document outlines a calculus project focused on the application of differentiation, detailing contributions from three students and their respective sections. It covers various topics including related rates, maximum and minimum values, derivatives, optimization problems, and Newton's method, providing theoretical explanations and examples. The content is structured into chapters with specific exercises and examples to illustrate the concepts discussed.

Uploaded by

khoa.ngo2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views27 pages

CC18 Topic1 ApplicationofDiffentiation

The document outlines a calculus project focused on the application of differentiation, detailing contributions from three students and their respective sections. It covers various topics including related rates, maximum and minimum values, derivatives, optimization problems, and Newton's method, providing theoretical explanations and examples. The content is structured into chapters with specific exercises and examples to illustrate the concepts discussed.

Uploaded by

khoa.ngo2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 27

VIETNAM NATIONAL UNIVERSITY HO CHI MINH CITY

HO CHI MINH CITY UNIVERSITY OF TECHNOLOGY


FACULTY OF COMPUTER SCIENCE AND ENGINEERING

Calculus 1-CC18

Topic 1:

Application of Differentiation

Advisor(s): Phan Thành An


Student(s): Hoàng Xuân Bách

[email protected] Nguyễn
Thế Vỹ

[email protected] Ngô Minh


Khoa [email protected]

HO CHI MINH CITY, DECEMBER 2023


Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

Member list & Workload

No. Full name Student ID Contribution

1 Hoàng Xuân 2352082 chap 4.7 Ex.50, 65 and LaTeX


Bách writer
2 Nguyễn Thế Vỹ 2353364 chap 4.2 Ex.13, 14 and Ex.66
chap 4.4
3 Ngô Minh Khoa 2352567 chap 4.1 Ex.72 and chap 4.8
Ex.32

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

2 Maximum and Minimum Values 5


2.1 Theory........................................................................................................................5

3 Derivatives and the Shapes of Curves 6


3.1 Theory........................................................................................................................6

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

Figure 1.1: Volume of water

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

2 Maximum and Minimum Values


2.1 Theory
Definition 1
Let c be a number in the domain D of a function f . Then f (c)
is the absolute maximum value of f on D if f (c) ≥ f (x) for
all in D. absolute minimum value of f on D if f (c) ≤ f (x)
for all in D.

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.

The Extreme Value Theorem


If f is continuous on a closed interval [a, b], then f attains an absolute
maximum value
f (c) and an absolute minimum value f (d) at some numbers c and d in
[a.b].

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.

The Closed Interval Method


To find the absolute maximum and minimum values of a continuous function
f on a closed interval [a, b]:
1. Find the values of f at the critical numbers of f in (a, b) .
2. Find the values of f at the endpoints of the interval.
3.The largest of the values from Steps 1 and 2 is the absolute maximum
value; the smallest of these values is the absolute minimum value.

5
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

3 Derivatives and the Shapes of Curves


3.1 Theory
Rolle’s Theorem:
Let f be continuous on [a, b] and differentiable on (a, b). If f (a) = f (b) then
there is
c ∈ (a, b) such that f′(c) = 0.

Figure 3.1: Rolle’s Theorem Proof

La-grange’s Mean Value Theorem


(generalization of Rolle’s Theorem): Let f be continuous on [a, b] and
differentiable on
(a, b). There is c ∈ (a, b) such that f′(c) = f(b)−f(a).
b−
a

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.

The First Derivative Test:


Suppose that c is a critical number of a continuous function f .
(a) If f ′ changes from positive to negative at c, then f has a local maximum at c .
(b) If f ′ changes from negative to positive at c, then f has a local minimum at c.
(c) If f ′ does not change sign at c (for example, if f ′ is positive on both
sides of c or negative on both sides), then f has no local maximum or
minimum at c.

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 .

The Secondary Derivative Test:


Suppose f′′ is continuous near c.
If f′(c) = 0 and f ′′(c) > 0, then f has a local
minimum at c. If f′(c) = 0 and f ′′(c) < 0, then f
has a local maximum at c.

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

Step 3: Take derivative and solve:

lim f′(x) 6 cos 6 cos 6x cos2


′ = = 2x
lim 6x lim
2 =3
x→0 g (x) x→0 2 sec x→0 2
2x

8
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

5 Optimization Problems
Step in Solving Optimization

Problem Step 1: Understand the

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

Step 3: Introduce Notation

Figure 5.1: Area=xy

Step 4: As given: 2x + y = 2400(ft) → y = 2400 − 2x


Step 5: Express A with one variable x: A(x) = xy = x(2400 − 2x) = 2400x
2 −
2x
Step 6: A′(x) = 2400 − 4x = 0 → x = 600 → The maximum Area of
rectangle field occurs when 1200ft wide and 600ft deep.

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

We then find the equation of the line tangent to y = f (x) at x = x1 and


follow it back to the x − axis to get a new (and improved!) guess x2 from
the formula

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

so let’s start Newton’s method with the initial guess x1 = 1.5


1 1 1 1
x2 = x1 + = (1.5) + = 1.416666667
2 1 2 1.5
x

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

Since f (1.4142135615) = −2.5 · 10−9 < 0 and f (1.4142135625) = 3.6 ·


10−10 > 0 the square
root of two must be between 1.4142135615 and 1.4142135625.

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.

Figure 7.1: 4.1 Ex.72

12
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

Figure 7.2: 4.1 Ex.72

13
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

7.2 Chapter 4.2 Ex.13


Find the number that satisfies the conclusion of the Mean Value Theorem
on the given interval. Graph the function, the secant line through the
endpoints, and the tangent line at (c, f (c)). Are the secant line and the
tangent line parallel?

f (x) = x, [0, 4]

Figure 7.3: 4.2 Ex.13

14
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

Figure 7.4: 4.2 Ex.13

15
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

7.3 Chapter 4.2 Ex.14


Find the number that satisfies the conclusion of the Mean Value Theorem
on the given interval. Graph the function, the secant line through the
endpoints, and the tangent line at (c, f (c)). Are the secant line and the
tangent line parallel?

f (x) = e−x, [0, 2]

Figure 7.5: 4.2 Ex.14

16
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

Figure 7.6: 4.2 Ex.14

17
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

7.4 Chapter 4.4 Ex.66


Find the limit. Use l’Hospital’s Rule where appropriate. If there is a more
elementary method, consider using it. If l’Hospital’s Rule doesn’t apply,
explain why.

2x − 3 (2x+1)
lim ( )
x→∞ 2x + 5

Figure 7.7: 4.4 Ex.66

Figure 7.8: 4.4 Ex.66

exp(-8)=0.00033546262790251

18
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

7.5 Chapter 4.7 Ex.50


An oil refinery is located on the 1 km north bank of a straight river that is 2
km wide. A pipeline is to be constructed from the refinery to storage tanks
located on the south bank of the river 6 km east of the refinery. The cost
of laying pipe is $400000/km over land to a point on the north bank and
$800000/km under the river to the tanks. To minimize the cost of the
pipeline, where should P be located?

Figure 7.9: 4.7 Ex.50

19
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

Figure 7.10: 4.7 Ex.50

20
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

7.6 Chapter 4.7 Ex.65


A point P needs to be located somewhere on the line AD so that the total
length L of cables linking P to the points A, B and C and is minimized (see
the figure). Express L as a function of x = |AP| and use the graphs of L and
to estimate dL/dx the minimum value of L

Figure 7.11: 4.7 Ex.65

21
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

Figure 7.12: 4.7 Ex.65

22
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

7.7 Chapter 4.8 Ex.32


(a) Use Newton’s method with x1 = 1 to find the root of the equation x3 − x
= 1 correct to six decimal places.

Figure 7.13: matlab code and solution for (a)

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.

Figure 7.14: matlab code and solution for (b)

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.);

Figure 7.15: matlab code and solution for (c)

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.

Figure 7.16: 4.8 Ex.32 (d)

Figure 7.17: 4.8 Ex.32 (d)

26
Ho Chi Minh City University of Technology
Faculty of Computer Science and
Engineering

References
[1]Matlab Online.

[2]Overleaf.

[3]J.Stewart. Calculus. Concepts and Contexts, 7th ed. Thomson Learning,


2012.

[4]Michael Medvinsky. Accelerated Engineering Calculus I. 2019.

27

You might also like