Professional Documents
Culture Documents
Numerical Analysis 10th Edition Richard L. Burden Solutions Manual PDF
Numerical Analysis 10th Edition Richard L. Burden Solutions Manual PDF
Numerical Analysis
TENTH EDITION
Richard L. Burden
Youngstown University
Youngstown, OH
© Cengage Learning. All rights reserved. No distribution allowed without express authorization.
J. Douglas Faires
Youngstown University
Youngstown, OH
Annette M. Burden
Youngstown University
Youngstown, OH
Prepared by
Richard L. Burden
Youngstown University, Youngstown, OH
Annette M. Burden
Youngstown University, Youngstown, OH
@solutionmanual1
click here to download
For product information and technology assistance, contact us at Cengage Learning products are represented in
Cengage Learning Customer & Sales Support, Canada by Nelson Education, Ltd.
1-800-354-9706.
To learn more about Cengage Learning Solutions,
For permission to use material from this text or product, submit visit www.cengage.com.
all requests online at www.cengage.com/permissions
Further permissions questions can be emailed to Purchase any of our products at your local college
permissionrequest@cengage.com.
store or at our preferred online store
www.cengagebrain.com.
NOTE: UNDER NO CIRCUMSTANCES MAY THIS MATERIAL OR ANY PORTION THEREOF BE SOLD, LICENSED, AUCTIONED,
OR OTHERWISE REDISTRIBUTED EXCEPT AS MAY BE PERMITTED BY THE LICENSE TERMS HEREIN.
Dear Professor or Other Supplement Recipient: material posted electronically must be through a password-
protected site, with all copy and download functionality disabled,
Cengage Learning has provided you with this product (the and accessible solely by your students who have purchased the
“Supplement”) for your review and, to the extent that you adopt associated textbook for the Course. You may not sell, license,
the associated textbook for use in connection with your course auction, or otherwise redistribute the Supplement in any form. We
(the “Course”), you and your students who purchase the ask that you take reasonable steps to protect the Supplement from
textbook may use the Supplement as described below. unauthorized use, reproduction, or distribution. Your use of the
Cengage Learning has established these use limitations in Supplement indicates your acceptance of the conditions set forth in
response to concerns raised by authors, professors, and other this Agreement. If you do not accept these conditions, you must
users regarding the pedagogical problems stemming from return the Supplement unused within 30 days of receipt.
unlimited distribution of Supplements.
All rights (including without limitation, copyrights, patents, and trade
Cengage Learning hereby grants you a nontransferable license secrets) in the Supplement are and will remain the sole and
to use the Supplement in connection with the Course, subject to exclusive property of Cengage Learning and/or its licensors. The
the following conditions. The Supplement is for your personal, Supplement is furnished by Cengage Learning on an “as is” basis
noncommercial use only and may not be reproduced, or without any warranties, express or implied. This Agreement will be
distributed, except that portions of the Supplement may be governed by and construed pursuant to the laws of the State of
provided to your students in connection with your instruction of New York, without regard to such State’s conflict of law rules.
the Course, so long as such students are advised that they may
not copy or distribute any portion of the Supplement to any third Thank you for your assistance in helping to safeguard the integrity
party. Test banks, and other testing materials may be made of the content contained in this Supplement. We trust you find the
available in the classroom and collected at the end of each class Supplement a useful teaching tool.
session, or posted electronically as described herein. Any
Contents
Chapter 11: Boundary-Value Problems for Ordinary Differential Equations .............................. 291
@solutionmanual1
click here to download
Preface
This Instructor’s Manual for the Tenth edition of Numerical Analysis by Burden,
Faires, and Burden contains solutions to all the exercises in the book. Although the
answers to the odd exercises are also in the back of the text, we have found that
users of the book appreciate having all the solutions in one source. In addition, the
results listed in this Instructor’s Manual often go beyond those given in the back of
the book. For example, we do not place the long solutions to theoretical and applied
exercises in the book. You will find them here.
A Student Study Guide for the Tenth edition of Numerical Analysis is also available
and the solutions given in the Guide are generally more detailed than those in the
Instructor’s Manual.
We have added a number of exercises to the text that can be implemented in any
generic computer algebra system such as Maple, Matlab, Mathematica, Sage, and
FreeMat. In our recent teaching of the course we found that students understood the
concepts better when they worked through the algorithms step-by-step, but let the
computer algebra system do the tedious computation.
It has been our practice to include in our Numerical Analysis book structured
algorithms of all the techniques discussed in the text. The algorithms are given in a
form that can be coded in any appropriate programming language, by students with
even a minimal amount of programming expertise.
At our companion website for the book,
https://sites.google.com/site/numericalanalysis1burden/
you will find all the algorithms written in the programming languages FORTRAN,
Pascal, C, Java, and in the Computer Algebra Systems, Maple, MATLAB, and Math-
ematica. For the Tenth edition, we have added new Maple programs to reflect the
NumericalAnalysis package.
The companion website also contains additional information about the book and
will be updated regularly to reflect any modifications that might be made. For exam-
ple, we will place there any responses to questions from users of the book concerning
interpretations of the exercises and appropriate applications of the techniques. We
also have a set of PowerPoint files for many of the methods in the book. Many
vii
@solutionmanual1
click here to download
viii Preface
of these files were created by Professor John Carroll of Dublin City University and
several were developed by Dr. Annette M. Burden of Youngstown State University.
We hope our supplement package provides flexibility for instructors teaching Nu-
merical Analysis. If you have any suggestions for improvements that can be incorpo-
rated into future editions of the book or the supplements, we would be most grateful
to receive your comments. We can be most easily contacted by electronic mail at the
addresses listed below.
@solutionmanual1
click here to download
Mathematical Preliminaries
3. For each part, f 2 C[a, b], f 0 exists on (a, b) and f (a) = f (b) = 0. Rolle’s Theorem implies
that a number c exists in (a, b) with f 0 (c) = 0. For part (d), we can use [a, b] = [ 1, 0] or
[a, b] = [0, 2].
4. (a) [0, 1]
(b) [0, 1], [4, 5], [ 1, 0]
(c) [ 2, 2/3], [0, 1], [2, 4]
(d) [ 3, 2], [ 1, 0.5], and [ 0.5, 0]
(a) 0.4620981
(b) 0.8
(c) 5.164000
(d) 1.582572
@solutionmanual1
click here to download
2 Exercise Set 1.1
p q q p
3 3
(d) f (x) = x 3 x2 ; 0 x 1; f 0 ( 2) = 0, 2 not in [0, 1], f (0) = 0, f (1) = 2, max0x1 |f (x)| =
p
2.
7. For each part, f 2 C[a, b], f 0 exists on (a, b) and f (a) = f (b) = 0. Rolle’s Theorem implies
that a number c exists in (a, b) with f 0 (c) = 0. For part (d), we can use [a, b] = [ 1, 0] or
[a, b] = [0, 2].
8. Suppose p and q are in [a, b] with p 6= q and f (p) = f (q) = 0. By the Mean Value Theorem,
there exists ⇠ 2 (a, b) with
f (p) f (q) = f 0 (⇠)(p q).
But, f (p) f (q) = 0 and p 6= q. So f 0 (⇠) = 0, contradicting the hypothesis.
9. (a) P2 (x) = 0
(b) R2 (0.5) = 0.125; actual error = 0.125
(c) P2 (x) = 1 + 3(x 1) + 3(x 1)2
(d) R2 (0.5) = 0.125; actual error = 0.125
10. P3 (x) = 1 + 12 x 1 2
8x + 1 3
16 x
11. Since
2e⇠ (sin ⇠ + cos ⇠) 3
P2 (x) = 1 + x and R2 (x) = x
6
for some ⇠ between x and 0, we have the following:
(a) P2 (0.5) = 1.5 and |f (0.5) P2 (0.5)| 0.0932;
(b) |f (x) P2 (x)| 1.252;
R1
(c) 0 f (x) dx ⇡ 1.5;
R1 R1 R1
(d) | 0 f (x) dx 0
P2 (x) dx| 0 |R2 (x)| dx 0.313, and the actual error is 0.122.
⇡ ⇡ 2 1 ⇠ ⇡ 3
12. P2 (x) = 1.461930+0.617884 x 6 0.844046 x 6 and R2 (x) = 3 e (sin ⇠+cos ⇠) x 6
for some ⇠ between x and ⇡6 .
5
(a) P2 (0.5) = 1.446879 and f (0.5) = 1.446889. An error bound is 1.01 ⇥ 10 , and the actual
error is 1.0 ⇥ 10 5 .
(b) |f (x) P2 (x)| 0.135372 on [0, 1]
R1 R1
(c) 0 P2 (x) dx = 1.376542 and 0 f (x) dx = 1.378025
3 3
(d) An error bound is 7.403 ⇥ 10 , and the actual error is 1.483 ⇥ 10 .
@solutionmanual1
click here to download
Mathematical Preliminaries 3
1
13. P3 (x) = (x 1)2 2 (x 1)3
(a) P3 (0.5) = 0.312500, f (0.5) = 0.346574. An error bound is 0.2916, and the actual error
is 0.034074.
(b) |f (x) P3 (x)| 0.2916 on [0.5, 1.5]
R 1.5 R 1.5
(c) 0.5 P3 (x) dx = 0.083, 0.5 (x 1) ln x dx = 0.088020
3
(d) An error bound is 0.0583, and the actual error is 4.687 ⇥ 10 .
15. P4 (x) = x + x3
16. First we need to convert the degree measure for the sine function to radians. We have 180 = ⇡
⇡
radians, so 1 = 180 radians. Since,
f (x) = sin x, f 0 (x) = cos x, f 00 (x) = sin x, and f 000 (x) = cos x,
cos ⇠ 3
f (x) ⇡ P2 (x) = x, and R2 (x) = x .
3!
If we use the bound | cos ⇠| 1, then
⇡ ⇡ ⇣ ⇡ ⌘ cos ⇠ ⇣ ⇡ ⌘3 7
sin = R2 = 8.86 ⇥ 10 .
180 180 180 3! 180
For |Rn ( 7⇡
30 )| < 10
6
, it suffices to take n = 3. To 7 digits,
7⇡
cos 42 = 0.7431448 and P3 (42 ) = P3 ( ) = 0.7431446,
30
7
so the actual error is 2 ⇥ 10 .
@solutionmanual1
click here to download
4 Exercise Set 1.1
Pn
18. Pn (x) = k=0 xk , n 19
n
X 1 k
19. Pn (x) = x , n 7
k!
k=0
1 3
20. For n odd, Pn (x) = x 3x + 15 x5 + · · · + n1 ( 1)(n 1)/2 n
x . For n even, Pn (x) = Pn 1 (x).
22. For x < 0, f (x) < 2x + k < 0, provided that x < 12 k. Similarly, for x > 0, f (x) > 2x + k > 0,
provided that x > 12 k. By Theorem 1.11, there exists a number c with f (c) = 0. If f (c) = 0
and f (c0 ) = 0 for some c0 6= c, then by Theorem 1.7, there exists a number p between c and c0
with f 0 (p) = 0. However, f 0 (x) = 3x2 + 2 > 0 for all x.
23. Since R2 (1) = 16 e⇠ , for some ⇠ in (0, 1), we have |E R2 (1)| = 61 |1 e⇠ | 61 (e 1).
(c) 0.8427008
(d) 0.8427069
(e) The series in part (a) is alternating, so for any positive integer n and positive x we have
the bound
n
2 X ( 1)k x2k+1 x2n+3
erf(x) p < .
⇡ (2k + 1)k! (2n + 3)(n + 1)!
k=0
We have no such bound for the positive term series in part (b).
(k)
25. (a) Pn (x0 ) = f (k) (x0 ) for k = 0, 1, . . . , n. The shapes of Pn and f are the same at x0 .
(b) P2 (x) = 3 + 4(x 1) + 3(x 1)2 .
26. (a) The assumption is that f (xi ) = 0 for each i = 0, 1, . . . , n. Applying Rolle’s Theorem
on each on the intervals [xi , xi+1 ] implies that for each i = 0, 1, . . . , n 1 there exists a
number zi with f 0 (zi ) = 0. In addition, we have
@solutionmanual1
click here to download
Mathematical Preliminaries 5
(b) Apply the logic in part (a) to the function g(x) = f 0 (x) with the number of zeros of g in
[a, b] reduced by 1. This implies that numbers wi , for i = 0, 1, . . . , n 2 exist with
g 0 (wi ) = f 00 (wi ) = 0, and a < z0 < w0 < z1 < w1 < · · · wn 2 < zn 1 < b.
(c) Continuing by induction following the logic in parts (a) and (b) provides n+1 j distinct
zeros of f (j) in [a, b].
(d) The conclusion of the theorem follows from part (c) when j = n, for in this case there
will be (at least) (n + 1) n = 1 zero in [a, b].
27. First observe that for f (x) = x sin x we have f 0 (x) = 1 cos x 0, because 1 cos x 1
for all values of x.
(a) The observation implies that f (x) is non-decreasing for all values of x, and in particular
that f (x) > f (0) = 0 when x > 0. Hence for x 0, we have x sin x, and | sin x| =
sin x x = |x|.
(b) When x < 0, we have x > 0. Since sin x is an odd function, the fact (from part (a))
that sin( x) ( x) implies that | sin x| = sin x x = |x|.
As a consequence, for all real numbers x we have | sin x| |x|.
28. (a) Let x0 be any number in [a, b]. Given ✏ > 0, let = ✏/L. If |x x0 | < and a x b,
then |f (x) f (x0 )| L|x x0 | < ✏.
(b) Using the Mean Value Theorem, we have
Thus
(c1 + c2 )m c1 f (x1 ) + c2 f (x2 ) (c1 + c2 )M
and
c1 f (x1 ) + c2 f (x2 )
m M.
c1 + c2
By the Intermediate Value Theorem 1.11 applied to the interval with endpoints x1 and
x2 , there exists a number ⇠ between x1 and x2 for which
c1 f (x1 ) + c2 f (x2 )
f (⇠) = .
c1 + c2
@solutionmanual1
click here to download
6 Exercise Set 1.2
2. We have
@solutionmanual1
click here to download
Mathematical Preliminaries 7
6. We have
7. We have
8. We have
@solutionmanual1
click here to download
8 Exercise Set 1.2
9. We have
10. We have
11. We have
12. We have
@solutionmanual1
click here to download
Mathematical Preliminaries 9
15.
16.
17.
@solutionmanual1
click here to download
10 Exercise Set 1.2
18.
(a) 3224
(b) 3224
(c) 1.32421875
(d) 1.3242187500000002220446049250313080847263336181640625
@solutionmanual1
click here to download
Mathematical Preliminaries 11
(b) 7.09 ⇥ 10 3
(c) The formula in (b) is more accurate since subtraction is not involved.
23. The approximate solutions to the systems are
(a) x = 2.451, y = 1.635
(b) x = 507.7, y = 82.00
24. (a) x = 2.460 y = 1.634
(b) x = 477.0 y = 76.93
25. (a) In nested form, we have f (x) = (((1.01ex 4.62)ex 3.11)ex + 12.2)ex 1.99.
(b) 6.79
(c) 7.07
(d) The absolute errors are
| 7.61 ( 6.71)| = 0.82 and | 7.61 ( 7.07)| = 0.54.
Nesting is significantly better since the relative errors are
0.82 0.54
= 0.108 and = 0.071,
7.61 7.61
26. Since 0.995 P 1.005, 0.0995 V 0.1005, 0.082055 R 0.082065, and 0.004195
N 0.004205, we have 287.61 T 293.42 . Note that 15 C = 288.16K.
When P is doubled and V is halved, 1.99 P 2.01 and 0.0497 V 0.0503 so that
286.61 T 293.72 . Note that 19 C = 292.16K. The laboratory figures are within an
acceptable range.
27. (a) m = 17
(b) We have
✓ ◆ ⇣m⌘ ✓m ◆ ✓ ◆
m m! m(m 1) · · · (m k 1)(m k)! 1 m k 1
= = = ···
k k!(m k)! k!(m k)! k k 1 1
(c) m = 181707
4
(d) 2,597,000; actual error 1960; relative error 7.541 ⇥ 10
28. When dk+1 < 5,
y f l(y) 0.dk+1 . . . ⇥ 10n k
0.5 ⇥ 10 k
k+1
= = 0.5 ⇥ 10 .
y 0.d1 . . . ⇥ 10n 0.1
When dk+1 > 5,
y f l(y) (1 0.dk+1 . . .) ⇥ 10n k
(1 0.5) ⇥ 10 k
k+1
= < = 0.5 ⇥ 10 .
y 0.d1 . . . ⇥ 10n 0.1
29. (a) The actual error is |f 0 (⇠)✏|, and the relative error is |f 0 (⇠)✏| · |f (x0 )| 1
, where the number
⇠ is between x0 and x0 + ✏.
(b) (i) 1.4 ⇥ 10 5 ; 5.1 ⇥ 10 6 (ii) 2.7 ⇥ 10 6 ; 3.2 ⇥ 10 6
(c) (i) 1.2; 5.1 ⇥ 10 5 (ii) 4.2 ⇥ 10 5 ; 7.8 ⇥ 10 5
@solutionmanual1
click here to download
12 Exercise Set 1.3
(b) The approximate sums are 1.16 and 1.19, respectively. The actual value is 1.197. Significant
roundo↵ error occurs earlier with the first method.
2. We have
4. 4 terms
5. 3 terms
1
6. (a) O n
1
(b) O n2
1
(c) O n2
1
(d) O n
(a) O(h2 )
(b) O(h)
(c) O(h2 )
(d) O(h)
Thus
|↵n ↵|/(1/np ) K and {↵n }1
n=1 ! ↵
@solutionmanual1
click here to download
Mathematical Preliminaries 13
(b)
h h2 h3 h4
@solutionmanual1
click here to download
14 Exercise Set 1.3
11. Since
1
lim xn = lim xn+1 = x and xn+1 = 1 + ,
n!1 n!1 xn
we have
1
x=1+ , so x2 x 1 = 0.
x
The quadratic formula implies that
1⇣ p ⌘
x= 1+ 5 .
2
This number is called the golden ratio. It appears frequently in mathematics and the sciences.
12. Let Fn = C n . Substitute into Fn+2 = Fn + Fn+1 to obtain C n+2 = C n + C n+1 p
or C n [C 2
1± 5
C 1] = 0. Solving the quadratic equation C 2 C 1 = 0 gives C = 2 . So Fn =
p p
a( 1+2 5 )n + b( 1 2 5 ) satisfies the recurrence relation Fn+2 = Fn + Fn+1 . For F0 = 1 and
p p p p
F1 = 1 we need a = 1+2 5 p15 and b = ( 1 2 5 ) p15 . Hence, Fn = p15 (( 1+2 5 )n+1 ( 1 2 5 )n+1 ).
PN
13. SU M = i=1 xi . This saves one step since initialization is SU M = x1 instead of SU M = 0
. Problems may occur if N = 0.
@solutionmanual1
click here to download
2. (a) p3 = 0.6875
(b) p3 = 1.09375
(a) p7 = 0.5859
(b) p8 = 3.002
(c) p7 = 3.419
(a) p7 = 1.414
(b) p8 = 1.414
(c) p7 = 2.727
(d) p7 = 0.7265
15
@solutionmanual1
click here to download
16 Exercise Set 2.1
(d) For the interval [0, 0.5], we have p16 = 0.20603180, and for the interval [0.5, 1], we have
p16 = 0.68196869.
7. (a)
y
2 y = f (x) y=x
1 2 x
5
10 x
y = tan x
210
(b) Using [4.2, 4.6] from part (a) gives p16 = 4.4934143.
9. (a)
y
y = cos (ex 2 2)
2
y = ex2 2
1
1 x
21
@solutionmanual1
click here to download
Solutions of Equations of One Variable 17
21. Since 1 < a < 0 and 2 < b < 3, we have 1 < a + b < 3 or 1/2 < 1/2(a + b) < 3/2 in all cases.
Further,
@solutionmanual1
click here to download
18 Exercise Set 2.2
9. Since g 0 (x) = 14 cos x2 , g is continuous and g 0 exists on [0, 2⇡]. Further, g 0 (x) = 0 only when
x = ⇡, so that g(0) = g(2⇡) = ⇡ g(x) = g(⇡) = ⇡ + 21 and |g 0 (x)| 14 , for 0 x 2⇡.
Theorem 2.3 implies that a unique fixed point p exists in [0, 2⇡]. With k = 14 and p0 = ⇡, we
have p1 = ⇡ + 12 . Corollary 2.5 implies that
✓ ◆n
kn 2 1
|pn p| |p1 p0 | = .
1 k 3 4
@solutionmanual1
click here to download
Solutions of Equations of One Variable 19
For the bound to be less than 0.1, we need n 4. However, p3 = 3.626996 is accurate to
within 0.01.
⇥1 ⇤
10. Using p0 = 1 gives p12 = 0.6412053. Since |g 0 (x)| = 2 x ln 2 0.551 on 3, 1 with k = 0.551,
Corollary 2.5 gives a bound of 16 iterations.
p
11. For p0 = 1.0 and g(x) = 0.5(x + x3 ), we have 3 ⇡ p4 = 1.73205.
p
12. For g(x) = 5/ x and p0 = 2.5, we have p14 = 2.92399.
14. The inequalities in Corollary 2.4 give |pn p| < k n max(p0 a, b p0 ). We want
5
ln(10 ) ln(max(p0 a, b p0 ))
k n max(p0 a, b p0 ) < 10 5
so we need n> .
ln k
(a) Using g(x) = 2 + sin x we have k = 0.9899924966 so that with p0 = 2 we have n >
ln(0.00001)/ ln k = 1144.663221. However, our tolerance is met with p63 = 2.5541998.
p
(b) Using g(x) = 3 2x + 5 we have k = 0.1540802832 so that with p0 = 2 we have n >
ln(0.00001)/ ln k = 6.155718005. However, our tolerance is met with p6 = 2.0945503.
p
(c) Using g(x) = ex /3 and the interval [0, 1] we have k = 0.4759448347 so that with
p0 = 1 we have n > ln(0.00001)/ ln k = 15.50659829. However, our tolerance is met with
p12 = 0.91001496.
(d) Using g(x) = cos x and the interval [0, 1] we have k = 0.8414709848 so that with p0 = 0
we have n > ln(0.00001)/ ln k > 66.70148074. However, our tolerance is met with p30 =
0.73908230.
p0 = 3 ) p8 = 3.16193; p0 = 3 ) p8 = 3.16193.
1 1
16. For g(x) = + x and p0 = 4, we have p4 = 4.493409.
tan x
x
1 ⇣ x⌘
17. With g(x) = arcsin + 2, we have p5 = 1.683855.
⇡ 2
0.4t
18. With g(t) = 501.0625 201.0625e and p0 = 5.0, p3 = 6.0028 is within 0.01 s of the actual
time.
@solutionmanual1
click here to download
20 Exercise Set 2.2
19. Since g 0 is continuous at p and |g 0 (p)| > 1, by letting ✏ = |g 0 (p)| 1 there exists a number > 0
such that |g 0 (x) g 0 (p)| < |g 0 (p)| 1 whenever 0 < |x p| < . Hence, for any x satisfying
0 < |x p| < , we have
If p0 is chosen so that 0 < |p p0 | < , we have by the Mean Value Theorem that
for some ⇠ between p0 and p. Thus, 0 < |p ⇠| < so |p1 p| = |g 0 (⇠)||p0 p| > |p0 p|.
1
Solving for p gives p = .
A
✓ ◆
1 3 1
(b) Any subinterval [c, d] of , containing suffices.
2A 2A A
Since
g(x) = 2x Ax2 , g 0 (x) = 2 2Ax,
1
so g(x) is continuous, and g 0 (x) exists. Further, g 0 (x) = 0 only if x = .
A
Since
✓ ◆ ✓ ◆ ✓ ◆
1 1 1 3 3 3 1
g = , g =g = , and we have g(x) .
A A 2A 2A 4A 4A A
1 3
For x in 2A , 2A , we have
✓ ◆
1 1 0 1 1
x < so |g (x)| = 2A x < 2A = 1.
A 2A A 2A
p ⇥1 ⇤
21. One of many examples is g(x) = 2x 1 on 2, 1 .
22. (a) The proof of existence is unchanged. For uniqueness, suppose p and q are fixed points in
[a, b] with p 6= q. By the Mean Value Theorem, a number ⇠ in (a, b) exists with
1⇣ p ⌘
p= 1+ 5 .
2
With p0 = 0.7, the sequence eventually alternates between 0 and 1.
@solutionmanual1