0% found this document useful (0 votes)
28 views3 pages

Tutorial 7

This document contains a tutorial on numerical methods and multivariate calculus, including problems related to rates of convergence, the bisection method, and Lagrange multipliers. It covers finding limits, approximations, and extreme values of functions under given constraints. The tutorial also includes exercises on contour drawing and graphical analysis for optimization problems.

Uploaded by

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

Tutorial 7

This document contains a tutorial on numerical methods and multivariate calculus, including problems related to rates of convergence, the bisection method, and Lagrange multipliers. It covers finding limits, approximations, and extreme values of functions under given constraints. The tutorial also includes exercises on contour drawing and graphical analysis for optimization problems.

Uploaded by

K. Lokishan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

MA1024B-23S2 Tutorial 07 Page 1 of 3

Numerical Methods

1. Find the rates of convergence of the following sequences as n → ∞.


(a) [sin ( n1 )]2
(b) sin ( n12 )
(c) log(n + 1) − log(n)
2. Suppose that as x approaches zero,

f1 (x) = L1 + O(xα ) and f2 (x) = L2 + O(xβ )

Let c1 , c2 be non-zero constants and define,

F (x) = c1 f1 (x) + c2 f2 (x) and G(x) = f1 (c1 x) + f2 (c2 x)

Show that if γ = min{α, β} then as x approaches zero,


(a) F (x) = c1 L1 + c2 L2 + O(xγ )
(b) G(x) = L1 + L2 + O(xγ )
3. Find the rates of convergence of the following functions as h → 0.
The big-O notation describes how fast the function goes to 0. The
(a) limh→0 [ 1−cos(h)
h2 ]= 1
2 leading term tells us the primary rate of decay.
sin(h)−h cos(h)
(b) limh→0 [ h ] =2
(c) limh→0 [ h−sin(h)
h ]=0
h
(d) limh→0 [ e h−1 ] = 1
4. Find the rate of convergence of the bisection method.

5. Find an approximation to 3 25 correct to within 10−4 using the bisection algorithm.
6. (a) Find a bound for the number of iterations needed to achieve an approximation
with accuracy 10−3 to the solution of

x4 − 2x3 − 4x2 + 4x + 4 = 0

on the interval [-1, 4].


(b) Find an approximation to the root with this degree of accuracy.
7. The function defined by f (x) = sin(πx) has zeros at every integer. Show that when
−1 < a < 0 and 0 < b < 3, the bisection method converges to,
(a) 0, if a + b < 2
(b) 1, if a + b = 2
(c) 2, if a + b > 2
MA1024B-23S2 Tutorial 07 Page 2 of 3

8. Use the bisection method to determine the height (h) of the portion of the sphere
above the water in the given diagram, ensuring the accuracy of 10−3 .

r = 1m
Density of Sphere, ρs = 200kg/m3

Note: The volume of the above-water portion of the sphere can be calculated with,
πh2
V = (3r − h)
3

Multivariate Calulus & PDE

1. Use Lagrange multipliers to find the maximum and minimum values of f subject
to the given constraint, if such values exist. Make an argument supporting the
classification of your minima and maxima.
(a) f (x, y) = 2x + 3y, x2 + y 2 = 25
(b) f (x, y) = xy, 9x2 + 4y 2 = 36
2. (a) Draw contours of f (x, y) = 4x + 3y for z = −30, −25, −20, −10, 0, 10, 25, 30.
(b) On the same axes, graph the constraint x2 + y 2 = 25.
(c) Use the graphs to approximate the points at which f has a maximum or a
minimum value subject to the constraint x2 + y 2 = 25.
(d) Use Lagrange multipliers to find the maximum and minimum values of
f (x, y) = 4x + 3y subject to x2 + y 2 = 25.
3. Find the points on the sphere x2 + y 2 + z 2 = 16 that are closest to and farthest from
the point (2, 3, 6).
x2 y2
4. Find the extreme values of f (x, y) = x2 + y 2 on the region 4 + 9 ≤ 1.
MA1024B-23S2 Tutorial 07 Page 3 of 3

5. Find the absolute maximum and minimum values of the function:

f (x, y) = x2 + y 2 + xy

on the domain
D = {(x, y) | |x| ≤ 1 and |y| ≤ 1}
.

You might also like