You are on page 1of 10

Full file at https://buklibry.

com/download/solutions-manual-numerical-analysis-9th-edition-by-burden-faires/

Student Sol uti ons Manual and Study Gui de


Chapters 1 & 2 Previ ew

for
Numerical Analysis
9th EDITION

Ri chard L. Burden
Youngstown State University

J. Dougl as Fai res


Youngstown State University

Prepared by

Ri chard L. Burden
Youngstown State University

J. Dougl as Fai res


Youngstown State University

Australia • Brazil • Japan • Korea • Mexico • Singapore • Spain • United Kingdom • United States

Download full file from buklibry.com


Full file at https://buklibry.com/download/solutions-manual-numerical-analysis-9th-edition-by-burden-faires/

© 2011 Brooks/Cole, Cengage Learning ISBN-13: 978-0-538-73563-6


ISBN-10: 0-538-73563-5
ALL RIGHTS RESERVED. No part of this work covered by the
copyright herein may be reproduced, transmitted, stored, or Brooks/Cole
used in any form or by any means graphic, electronic, or 20 Channel Center Street
mechanical, including but not limited to photocopying, Boston, MA 02210
recording, scanning, digitizing, taping, Web distribution, USA
information networks, or information storage and retrieval
systems, except as permitted under Section 107 or 108 of the Cengage Learning is a leading provider of customized
1976 United States Copyright Act, without the prior written learning solutions with office locations around the globe,
permission of the publisher except as may be permitted by the including Singapore, the United Kingdom, Australia,
license terms below. Mexico, Brazil, and Japan. Locate your local office at:
international.cengage.com/region

Cengage Learning products are represented in


For product information and technology assistance, contact us at Canada by Nelson Education, Ltd.
Cengage Learning Customer & Sales Support,
1-800-354-9706 For your course and learning solutions, visit
academic.cengage.com
For permission to use material from this text or product, submit
all requests online at www.cengage.com/permissions Purchase any of our products at your local college
Further permissions questions can be emailed to store or at our preferred online store
permissionrequest@cengage.com
www.ichapters.com

Download full file from buklibry.com


Full file at https://buklibry.com/download/solutions-manual-numerical-analysis-9th-edition-by-burden-faires/

Contents
Prefa e v

Mathemati al Preliminaries 1
Exer ise Set 1.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1

Exer ise Set 1.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5

Exer ise Set 1.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9

Solutions of Equations of One Variable 15


Exer ise Set 2.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15

Exer ise Set 2.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18

Exer ise Set 2.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21

Exer ise Set 2.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28

Exer ise Set 2.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31

Exer ise Set 2.6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34

Interpolation and Polynomial Approximation 37


Exer ise Set 3.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37

Exer ise Set 3.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42

Exer ise Set 3.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44

Exer ise Set 3.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50

Exer ise Set 3.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52

Exer ise Set 3.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58

Numeri al Differentiation and Integration 61


Exer ise Set 4.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61

Exer ise Set 4.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65

Exer ise Set 4.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70

Exer ise Set 4.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74

Exer ise Set 4.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78

Exer ise Set 4.6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80

Exer ise Set 4.7 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81

Exer ise Set 4.8 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84

Exer ise Set 4.9 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86

Initial-Value Problems for Ordinary Differential Equations 89


Exer ise Set 5.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89

Exer ise Set 5.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91

Exer ise Set 5.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 94

iii

Download full file from buklibry.com


Full file at https://buklibry.com/download/solutions-manual-numerical-analysis-9th-edition-by-burden-faires/

iv

Exer ise Set 5.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97

Exer ise Set 5.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103

Exer ise Set 5.6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104

Exer ise Set 5.7 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 108

Exer ise Set 5.8 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109

Exer ise Set 5.9 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111

Exer ise Set 5.10 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114

Exer ise Set 5.11 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115

Dire t Methods for Solving Linear Systems 119


Exer ise Set 6.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119

Exer ise Set 6.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 124

Exer ise Set 6.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129

Exer ise Set 6.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 134

Exer ise Set 6.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137

Exer ise Set 6.6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143

Iterative Te hniques in Matrix Algebra 151


Exer ise Set 7.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151

Exer ise Set 7.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153

Exer ise Set 7.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155

Exer ise Set 7.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157

Exer ise Set 7.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158

Exer ise Set 7.6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 160

Approximation Theory 165


Exer ise Set 8.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165

Exer ise Set 8.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 167

Exer ise Set 8.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 170

Exer ise Set 8.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171

Exer ise Set 8.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173

Exer ise Set 8.6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 175

Approximating Eigenvalues 179


Exer ise Set 9.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179

Exer ise Set 9.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 182

Exer ise Set 9.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 184

Exer ise Set 9.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187

Exer ise Set 9.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188

Exer ise Set 9.65 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193

Numeri al Solutions of Nonlinear Systems of Equations 199


Exer ise Set 10.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199

Exer ise Set 10.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201

Exer ise Set 10.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204

Exer ise Set 10.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 207

Exer ise Set 10.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209

Download full file from buklibry.com


Full file at https://buklibry.com/download/solutions-manual-numerical-analysis-9th-edition-by-burden-faires/

Boundary-Value Problems for Ordinary Differential Equations 213


Exer ise Set 11.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 213

Exer ise Set 11.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 216

Exer ise Set 11.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 219

Exer ise Set 11.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 222

Exer ise Set 11.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225

Numeri al Solutions to Partial Differential Equations 233


Exer ise Set 12.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 233

Exer ise Set 12.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 234

Exer ise Set 12.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 239

Exer ise Set 12.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 242

Download full file from buklibry.com


Full file at https://buklibry.com/download/solutions-manual-numerical-analysis-9th-edition-by-burden-faires/

vi Prefa e

Download full file from buklibry.com


Full file at https://buklibry.com/download/solutions-manual-numerical-analysis-9th-edition-by-burden-faires/

2 Exer ise Set 1.1

9. Find the se ond Taylor polynomial for f (x) = ex cos x about x0 = 0, and:

a. Use P2 (0.5) to approximate f (0.5), nd an upper bound for |f (0.5) − P2 (0.5)|, and ompare this

to the a tual error.


b. Find a bound for the error |f (x) − P2 (x)|, for x in [0, 1].
Z 1 Z 1
. Approximate f (x) dx using P2 (x) dx.
0 0
d.Find an upper bound for the error in part ( ).
SOLUTION: Sin e
f ′ (x) = ex (cos x − sin x), f ′′ (x) = −2ex (sin x), and f ′′′ (x) = −2ex (sin x + cos x),
we have f (0) = 1, f ′ (0) = 1, and f ′′ (0) = 0. So
−2eξ (sin ξ + cos ξ) 3
P2 (x) = 1 + x and R2 (x) = x .
3!
a. We have P2 (0.5) = 1 + 0.5 = 1.5 and
−2eξ (sin ξ + cos ξ)

1
|f (0.5) − P2 (0.5)| ≤ max (0.5) ≤ (0.5)2 max |eξ (sin ξ + cos ξ)|.
2
ξ∈[0.0.5] 3! 3 ξ∈[0,0.5]

To maximize this quantity on [0, 0.5], rst note that Dx ex (sin x + cos x) = 2ex cos x > 0, for all x in
[0, 0.5]. This implies that the maximum and minimum values of ex (sin x + cos x) on [0, 0.5] o ur at
the endpoints of the interval, and
e0 (sin 0 + cos 0) = 1 < e0.5 (sin 0.5 + cos 0.5) ≈ 2.24.
Hen e
1
|f (0.5) − P2 (0.5)| ≤ (0.5)3 (2.24) ≈ 0.0932.
3

b. A similar analysis to that in part (a) gives, for all x ∈ [0, 1],
1
|f (x) − P2 (x)| ≤ (1.0)3 e1 (sin 1 + cos 1) ≈ 1.252.
3

.
1 1 1
x2

3
Z Z
f (x) dx ≈ 1 + x dx = x + = .
0 0 2 0 2
d. From part (b),
1 1 1
1 1
Z Z Z
|R2 (x)| dx ≤ e (cos 1 + sin 1)x3 dx = 1.252x3 dx = 0.313.
0 0 3 0

Sin e
1 1
ex

e 1
Z
ex cos x dx = (cos x + sin x) = (cos 1 + sin 1) − (1 + 0) ≈ 1.378,
0 2 0 2 2
the a tual error is |1.378 − 1.5| ≈ 0.12.

Download full file from buklibry.com


Full file at https://buklibry.com/download/solutions-manual-numerical-analysis-9th-edition-by-burden-faires/

Mathemati al Preliminaries 7

b. With three-digit rounding arithmeti we have e0.100 = 1.11 and e−0.100 = 0.905, so
1.11 − 0.905 0.205
f (0.100) = = = 2.05.
0.100 0.100

. The third Ma laurin polynomials give


1 1 1 1
ex ≈ 1 + x + x2 + x3 and e−x ≈ 1 − x + x2 − x3 ,
2 6 2 6
so
1 + x + 12 x2 + 61 x3 − 1 − x + 21 x2 − 16 x3 2x + 31 x3
 
1
f (x) ≈ = = 2 + x2 .
x x 3
Thus, with three-digit rounding, we have
1
f (0.100) ≈ 2 + (0.100)2 = 2 + (0.333)(0.001) = 2.00 + 0.000333 = 2.00.
3

15. . Find the de imal equivalent of the oating-point ma hine number


0 01111111111 0101001100000000000000000000000000000000000000000000.

SOLUTION: This binary ma hine number is the de imal number


 2  4  7  8 !
1 1 1 1
+ 21023−1023 1 + + + +
2 2 2 2
 
1 1 1 1 83
= 20 1 + + + + =1+ = 1.32421875.
4 16 128 256 256

16. . Find the de imal equivalents of the next largest and next smallest oating-point ma hine number to
0 01111111111 0101001100000000000000000000000000000000000000000000.

SOLUTION: The next smallest ma hine number is


0 01111111111 0101001011111111111111111111111111111111111111111111
=1.32421875 − 21023−1023 2−52


=1.3242187499999997779553950749686919152736663818359375,

and next largest ma hine number is


0 01111111111 0101001100000000000000000000000000000000000000000001
=1.32421875 + 21023−1023 2−52


=1.3242187500000002220446049250313080847263336181640625.

21. a. Show that the polynomial nesting te hnique an be used to evaluate


f (x) = 1.01e4x − 4.62e3x − 3.11e2x + 12.2ex − 1.99.

Download full file from buklibry.com


Full file at https://buklibry.com/download/solutions-manual-numerical-analysis-9th-edition-by-burden-faires/

12 Exer ise Set 1.3

b. G(x) = L1 + L2 + O (xγ )
SOLUTION: Suppose for suf iently small |x| we have positive onstants k1 and k2 independent of
x, for whi h
|F1 (x) − L1 | ≤ K1 |x|α and |F2 (x) − L2 | ≤ K2 |x|β .
Let c = max (|c1 |, |c2 |, 1), K = max (K1 , K2 ), and δ = max (α, β).
a. We have

|F (x) − c1 L1 − c2 L2 | =|c1 (F1 (x) − L1 ) + c2 (F2 (x) − L2 )|


≤|c1 |K1 |x|α + |c2 |K2 |x|β
≤cK |x|α + |x|β


≤cK|x|γ 1 + |x|δ−γ ≤ K|x|γ ,




for suf iently small |x|. Thus, F (x) = c1 L1 + c2 L2 + O (xγ ).


b. We have

|G(x) − L1 − L2 | =|F1 (c1 x) + F2 (c2 x) − L1 − L2 |


≤K1 |c1 x|α + K2 |c2 x|β
≤Kcδ |x|α + |x|β


≤Kcδ |x|γ 1 + |x|δ−γ ≤ K ′′ |x|γ ,




for suf iently small |x|. Thus, G(x) = L1 + L2 + O (xγ ).


16. Consider the Fibona i sequen e dened by F0 = 1, F1 = 1, and Fn+2 = Fn+1 + Fn , if n ≥ 0.
Dene xn = Fn+1  n . Assuming that limn→∞ xn = x onverges, show that the limit is the golden
√ /F
ratio: x = 1 + 5 /2.

SOLUTION: Sin e
1
lim xn = lim xn+1 = x and xn+1 = 1 + ,
n→∞ n→∞ xn
we have
1
x=1+ , whi h implies that x2 − x − 1 = 0.
x
√ 
The only positive solution to this quadrati equation is x = 1 + 5 /2.
17. The Fibona i sequen e also satises the equation
" √ !n √ !n #
1 1+ 5 1− 5
Fn ≡ F̃n = √ − .
5 2 2

a. Write a Maple pro edure to al ulate F100 .


b. Use Maple with the default value of Digits followed by evalf to al ulate F̃100 .

. Why is the result from part (a) more a urate than the result from part (b)?

d. Why is the result from part (b) obtained more rapidly than the result from part (a)?

e. What results when you use the ommand simplify instead of evalf to ompute F̃100 ?

Download full file from buklibry.com


Full file at https://buklibry.com/download/solutions-manual-numerical-analysis-9th-edition-by-burden-faires/

32 Exer ise Set 2.5

(0) (0) (1)


Substituting for p0 , p2 , and p0 gives
 2  2
(0) (0)
p1 − 1 p1 − 1
0.75 = 1 − (0)
, that is, 0.25 = (0)
.
3 − 2p1 + 1 4 − 2p1
Thus
1 (0)  (0) 2 (0)

(0)
2
(0)
1 − p1 = p1 − 2p1 + 1, so 0 = p1 − 1.5p1 ,
2
(0) (0)
and p1 = 1.5 or p1 = 0.
11. b. Use Steffensen's method to approximate the solution to within 10−5 of x = 0.5(sin x + cos x),
where g(x) = 0.5(sin x + cos x).
SOLUTION: With g(x) = 0.5(sin x + cos x), we have
(0) (0)
p0 = 0, p1 = g(0) = 0.5,
(0)
p2 = g(0.5) = 0.5(sin 0.5 + cos 0.5) = 0.678504051,
 2
(0) (0)
p1 − p0
(1) (0)
p0 = p0 − (0) (0) (0)
= 0.777614774,
p2 − 2p1 + p0
 
(1) (1)
p1 = g p0 = 0.707085363,
 
(1) (1)
p2 = g p1 = 0.704939584,
 2
(1) (1)
p1 − p0
(2) (1)
p0 = p0 − (1) (1) (1)
= 0.704872252,
p2 − 2p1 + p0
 
(2) (2)
p1 = g p0 = 0.704815431,
 
(2) (2)
p2 = g p1 = 0.704812197,
 2
(2) (2)
p1 − p0
(3) (2)
p0 = p0 = (2) (2) (2)
= 0.704812002,
p2 − 2p1 + p0
 
(3) (3)
p1 = g p0 = 0.704812002,
and
 
(3) (3)
p2 = g p1 = 0.704812197.
(3) (3) (3) (3)
Sin e p2 , p1p0 , and all agree to within 10−5 , we a ept p2 = 0.704812197 as an answer that is
−5
a urate to within 10 .

14. a. {pn } that onverges to p with order α > 1 onverges superlinearly to p.


Show that a sequen e
1
b. Show that the sequen e pn = onverges superlinearly to 0, but does not onverge of order α for
nn
any α > 1.

SOLUTION: Sin e {pn } onverges to p with order α > 1, a positive onstant λ exists with
|pn+1 − p|
λ = lim .
n→∞ |pn − p|α

Download full file from buklibry.com

You might also like