Scientific Computing

Karlstad University
Department of Electrical Engineering
Eva Mossberg

Answers to selected exercises in

Heath: Scientific Computing

Chapter 2
2.13. First solve L1 x = b, for x, then solve L2 y = c Bx for y.
2.21. Solve Cy = b for y. Compute z = Ab. Compute u = y + z. Compute v = 2Au + u.
Solve Bx = v for x.
2.33. False. Example: A = diag(2, 1).
2.41. (b) LU-factorization: O(n) work, O(n) memory. Inversion: O(n3 ) work, O(n2 )
memory.
2.43. This type of solution using real arithmetics requires twice as much storage and
more than twice as much work as solving the problem directly using complex
arithmetics. (But without complex arithmetics, this is a way.)

Chapter 3
#

"

"

10.95
x=
,
0.065

11.1
,
3.1. (b) x =
0.05

"

"

10.65
x=
. No rigorous reason to prefer any
0.08
#

10.925
of three solutions. (c) x =
.
0.065

1 e

3.3. A = 2 e2 ,
3 e3

b = 3

3.4. Yes, rank(A) = 2.

3.5. (c), because its orthogonal to Col A.
" #

3.6. (a) krk2 = 1. (b) x =

"

"

1
.
1
#

1 0
1 0
3.34. (a)
. (b)
. (c) May be illconditioned problem.
0 0
0 1/

Chapter 4
4.3. (a) 2 2 3. (b)+(c) 1 = 3, 2 = 1. (d) v1 = constant [1 0.5]T and
v2 = constant [1 0.5]T . (e) constant [1 0.4]T . (f) v1 . (g) 3.5. (h) v2 . (i) 1 .
(j) triangular.
4.28. (a) 1 or n . (b) = (2 + n ) /2 and = (1 + n1 ) /2, respectively. (c) Any
k , k .
4.29. (c) This type of solution using real arithmetics requires twice as much storage
and more than twice as much work as solving the problem directly using complex
arithmetics, and it also turns simple eigenvalues into multiple eigenvalues. (But
without complex arithmetics, this is a way.)
4.36. (b) No, requires twice the storage.

Chapter 5
5.1. (a) 3/2. (b) 4/3.
5.4. xk+1 = 2xk x2k y.
"

5.9. (a) xk+1

"

2x1 2x2
x2 + x2 1
= xk + sk , where sk is found from
sk = 1 2 2
.
x1 x2
2x1 1

5.10. x1 = [0.5 0.5]T .

5.13. The Jacobian is singular for x = [0 ]T .

Chapter 6
6.5. (a) (0, 0) is a saddle point. (b) (0, 0) saddle point, (1, 1) local and global min,
(1, 1) local and global min. (c) (0, 0) saddle point, (1, 0) local min, (0, 1)
saddle point, (1, 1) local max. (d) (1, 1) saddle point.
6.6. (a) (0.5, 0.5, 1) constr. min. (b) (0.5, 0.5, 0.75) constr. min.
(c) (0.894, 0.447, 1.12) constr. min, (0.894, 0.447, 1.12) constr. max. (d) (0.794, 1.12, 1.26)
constr. min.
6.8. (a) (1, 1). (b) x1 = [1.8 3.2]T . (c) f (x1 ) < f (x0 ). (d) |x1 x | > |x0 x |.
6.9. (b) Convergence in one iteration.
6.16. (a) No solution to the system for x, y, (Jg vanishes at teh minimum point (1, 0)).
2

Chapter 9
9.1. Linear systems u0 (t) = A(t)u(t) + g(t).

0 1 0
0 1
0

(a) A(t) A =
, g(t) =
. (b) A(t) = 0 0 1 , g(t) = 0.
1 1
t
t 0 1

0
0 1 0

(c) A(t) A = 0 0 1 , g(t) = 0 .

1t
1 2 1
"

" #

9.2. Non-linear systems u0 (t) = f (t, u).

"

(a) f (t, u) = f (u) =

u2
.
u2 (1 u21 ) u1

u2
GM u (u2 + u2 )3/2

1 1
3
(c) f (t, u) = f (u) =
.

u4
2
2
3/2
GM u3 (u1 + u3 )
9.3. Yes, (A) < 0.
9.4. (a) Yes. (b) No. (c) 1.5. (d) Yes. (e) 0.2875.
#

"

9.7. (a)

u0

" #

"

1
2.0
0 1
. (b) u0 =
. (c) No. (d)
. (e) No. (f) No.
=
2
2.5
1 0

9.13. xk = Ak x0 , (A) 6 1.

x(t) = eAt x0 =

i vi ei t , Re(i ) 6 0.

Chapter 10
10.3. s = ( )/(b a)
"

10.4. (a) 1.

y0

"

0 1
0
=
y+
.
0 0
4

2. s0 = 2, s1 = 2.

u2

(b) f (t, u) = f (u) = u3 .

u1 u3

3. 1.5.