Scribd
Upload
40 views

Appendix A

This document contains solutions to problems involving matrix algebra. Problem A.1 involves multiplying, adding, and inverting matrices. Key steps include finding the inverse and determinant of matrices. Problem A.2 solves a system of equations using matrices. Problem A.3 derives the inverse transformation between two coordinate systems. Problem A.4 computes lengths, angles, and linear independence of vectors. Problem A.5 computes the determinant of a 3x3 matrix.

Uploaded by

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

Appendix A

This document contains solutions to problems involving matrix algebra. Problem A.1 involves multiplying, adding, and inverting matrices. Key steps include finding the inverse and determinant of matrices. Problem A.2 solves a system of equations using matrices. Problem A.3 derives the inverse transformation between two coordinate systems. Problem A.4 computes lengths, angles, and linear independence of vectors. Problem A.5 computes the determinant of a 3x3 matrix.

Uploaded by

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

Appendix A

Problem A.1
(a)

1 7
1 1 0 4

A B =

1 11
2 1 1 3
0 4
B A=

1 3

1 1
8 4

2 1
7 4

A B B A
1 2

1 1

0 4
2 10

1 3
1 7

(b)

AT B

(c)

A B

(d)

A B

(e)

det A (1)(1) (1)(2) 1


det B (0)(3) (1)(4) 4

(f)

adj A

(g)

A1

1
2

1
1

0 4
1 5
1 3 3 4

1 3
1 1 0 4

1 2
2 1 1 3

1 1

2 1

3 4

1 0

adj B

adj A 1 1

det A 2 1

Verify:

B 1

adj B
det B

3 / 4 1

1/ 4 0

1 0
1 1 1 1

0 1
2 1 2 1

A1 A

1 0
3 / 4 1 0 4

0 1
1/ 4 0 1 3

B 1 B

Problem A.2

(a)

1 2 3
A 3 2 1
1 0 1

1
2
b

3

det A 8

1 2 3 1
D AMb 3 2 1 2
1 0 1 1
subtract row 1 from row 3
1 2 3
D 3 2 1
0 2 2

1
2
0

det A 8

multiply row 1 by 3 and subtract from row 2


1 2 3 1
D 0 4 8 1
0 2 2 0

det A 8

multiply row 2 by and subtract from row 3


1
1 2 3

D 0 4 8 1
0 0 2 1/2

det A 8

Thus,
2
3
1
0 4 8

0
0
2

x1
1
x

2 = 1
x3
1/ 2

2x3 x3

4 x2 8 x3 4 x2 8(1/ 4) 1 x2 1/ 4
x1 2 x2 3 x3 x1 2(1/ 4) 3(1/ 4) 1

x1 3 / 4
x 3 / 4 1/ 4 1/ 4
(b)

x A1b
2 2 2
2 2
2

adj A 4 8 4
A1

det A
8
1/ 4
x 1/ 4
1/ 4

(c)

1/ 4 1/ 2
1/ 4 1
1/ 4 1/ 2

1
2

1/ 4
1/ 4
1/ 4

1/ 4 1/ 2
1/ 4 1
1/ 4 1/ 2

3/ 4
1/ 4
1/ 4

1 2 3
6
x1 2 2 1 det A
3/ 4
8
1 0 1
1 1 3
2
x2 3 2 1 det A
1/ 4
8
1 1 1
1 2 1
2
x3 3 2 2 det A
1/ 4
8
1 0 1

Problem A.3
z1 3 x1 x3
z2 x1 x2 x3

3 0 1
or z Ax , A 1 1 1
0 2 1

z3 2 x2 x3
Solve x3 z1 3x1
z2 x1 x2 z1 3x1 x2 2 x1 z1

x2 z3 x3 z3 z1 x1
z2 z3 z1 x1 2 x1 z1

Then

x1 z1 2 z2 z3
x3 z1 3x1 z1 3( z1 2 z2 z3 )

Now

x3 2 z1 6 z2 3z3
1

x2 z3 x3

and,

x2 z1 3 z2 2 z3

or,

1
1 2

x 1 3
2 z
2 6 3

Also,

x A1 z

1 1 2
adj A
2 3 6

det A
1 2
3

1 2 1

1 3 2

2 6 3

1
This checks with the result obtained using algebraic manipulation.
Problem A.4
x xT x

1/ 2

x1 12 12 22

1/ 2

x2 12 02 22

6 2.45

1/ 2

5 2.24

1
x x2 1 1 2 0 5
2
T
1

1
1 0 2

1 0 2
x1 x 1 1 0 2

2
2 0 4
T
2

1 0 0 1
1

x Ax1 1 1 2 0 2 0 1 1 2 8 1 19
0 0 4 2
2
T
1

Let x3 x31 x32 x33

T
1
2
3
. Then x1 x3 x3 x3 2 x3

1
2
T
3
Let x3 x3 1 . Then x1 x3 0 x3 1

x3 1 1 1 is orthogonal to x1 .
T

det x1 Mx2 Mx3 det 1


2

1 1
0 1 3
2 1

x1 , x2 and x3 are linearly independent.


Problem A.5
1 1
A 1 0
2 3

2
1
1

Using minors of the second row,


det A (1)(1)1 2

(1)( 1)3 2

1 2
1 2
(0)(1) 2 2
3 1
2 1
1 1
2 3

1(1 6) 0 (1)(3 2) 8
Using minors of the third column,

det A (2)(1)13

(1)( 1)33

1 0
1 1
(1)(1) 23
2 3
2 3
1 1
1 0

2(3 0) (1)( 3 2) (1)(0 1) 8


Problem A.6
(a)


A I

0 1

1 4

1
4

det( A I ) (4 ) 1 2 4 1 0
Eigenvalues are 1 2 5 and 2 = 2 5 .
The eigenvector v1 v11 v12
0 1
1 4

v11
v11

2
v12
v1

1
v12
0 1 v2
1 4 2 2 5 2

v2
v2

2 0 0
A 0 3 0
0 0 2

corresponding to 1 is given by
Let v11 1

The eigenvector v 2 v21 v22

(b)

v12 2 5
T

v1

2 5

corresponding to 2 is
Let

v12 1

v22 2 5

v2

2 5

det( A I ) (2 )(3 )(2 ) 0


eigenvalues are 1 2, 2 3
and 3 2 .

The eigenvector v1 corresponding to 1 2 is

2 0 0
0 3 0

0 0 2

v11

v1 2
v13

Say v1 1 0 1

v11

v1
v13

2v11 2v11 v11 arbitrary


3v12 2v12 v12 0
2v13 2v13 v13 arbitrary

The eigenvector v2 corresponding to 2 3 is


2 0 0
0 3 0

0 0 2

v12

v2 3
v23

Say v 2 0 1 0

v21

v2
v23

2v21 3v21 v21 0


3v22 3v22 v22 arbitrary
2v23 3v23 v23 0

1
3
The eigenvector v3 corresponding to 3 2 is (by comparison with v1 ) , v3 , v3 arbitrary,
2
and v3 0. Say v3 1 0 1 .
T

Problem A.7
a11
A 2x2 symmetric matrix has the form
a12

a12
a22

The eigenvalues are the roots of the equation


( a11 )( a22 ) a12 0, or
2

2 (a11 a22 ) a11a22 a12 0


2

The discriminant of this quadratic equation is


D = (a11 a22 ) 2 4(a11a22 a122 ) (a11 a22 ) 2 a122
Since D is the sum of the squares of two real numbers, it cannot be negative. Therefore
a11 a12
the eigenvalues are real. Consider the asymmetric matrix

a21 a22
Its eigenvalues are the roots of the equation
( a11 )( a22 ) a12 a21 0, or
7

2 (a11 a22 ) a11a22 a12 a21 0


The discriminant of this quadratic equation is
D = (a11 a22 ) 2 4(a11a22 a21a12 )
= (a11 a22 ) 2 4a12 a21
For the eigenvalues to be complex, we must have D < 0. Thus an asymmetric matrix
whose elements satisfy the condition
(a11 a22 ) 2 4a12 a21 0
has complex eigenvalues.
Problem A.8
The LU decomposition algorithm used here is from B.A. Finlayson, Nonlinear Analysis
in chemical Engineering, McGraw Hill, NY, 1980.
1 1 0
A 2 3 1
1 0 1
Multiply row 1 by 2 and add to row 2, and multiply row 1 by 1 and add to row 3.
Then,
1 1
A 0 1
0 1
(1)

0
1
1

Multiply row 2 by 1 and add to row 3. Then,

(2)

1 1 0
0 1 1
0 0 2

Now,

UA

(2)

0 0
1 1 0
1

0 1 1 , and L
2 1 0
0 0 2
1 1 1

1 2 3
adj L
1
L
0 1 1
det L
0 0 1

1 0 0

2 1 0

3 1 1

1
1 0 0
b L1b 2 1 0


3 1 1

1 1
1 1

2 0

1 1 0
Ux b 0 1 1
0 0 2

x1 1
x 1
2
x3 0

From row 3, 2 x3 0 x3 0
From row 2, x2 x3 1 x2 1
From row 1, x1 x2 1 x1 2
x 2 1 0

Problem A.9
g 2 x1 x2 4

g1 x12 x22 8,

g / x1 g1 / x2
J 1

g 2 / x1 g 2 / x2

2 x1

2 x2
x
1

Starting point x1 0 1 . Note: superscript denotes iteration number.


T

Iteration 1:

g11 7
g 12 4

g11
1
g 2

0 2

1 0

J1

J 1x1

x11 4, x12 3.5


x12 x11 x11 4 , x22 x12 x12 4.5
Iteration 2:
g12 28.25
g12 14

8 9
J

4.5 4
2

g12
J x 2
g 2
2

x12 26 /17, x22 30.25 /17


x13 x12 x12 2.47059 x23 x22 x22 2.72059
Iteration 3:
g13 5.50541
g 23 2.72145

4.94118 5.44118
J3

2.72059 2.47059

x13 0.46475, x23 0.58976


x14 2.00584, x24 2.13083
Iteration 4:
g14 0.56383
g 24 0.27410

4.01168 4.26166
J4

2.13083 2.00584

x14 0.03594, x24 0.09847


x15 1.96990, x25 2.03236
Iteration 5:
g15 0.01099
g 25 0.00355
We stop now because g15 and g 25 are small enough. The solution is
x 1.96990 2.03236 . The exact solution is 2 2 .
T

10

If x1 4 4 is the starting point, then


T

8 8
1
1
. In this case x1 and x2
4
4

J1

cannot be uniquely determined. Thus, 4 4 cannot be used as a starting point for the
Newton-Raphson method.
T

11

You might also like