Documente Academic
Documente Profesional
Documente Cultură
Azzolino
Follow instructions on page. Many cells are self-computing.
Page Contents
● intro title & contents
● row transfrom to find inverse User & Spread sheet jointly use row transform
● matrix vs. cramers 3x3 Hot 3x3 solution of system by matrix and Cra
2 0 0 0 0+ 1 0 0 0 0 is 3 0 0 0
5 -3 0 0 0 0 1 0 0 0 5 -2 0 0
1 7 0 0 0 0 0 0 0 0 1 7 0 0
0 0 0 0 0 0 0 0 10 9 0 0 0 10
0 0 0 0 0 0 0 0 3 2 0 0 0 3
3 0 0 0 0 - 1 0 0 0 0 is 2 0 0 0
4 1 0 0 0 0 1 0 0 0 4 0 0 0
0 0 0 0 0 0 0 1 0 0 0 0 -1 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0
examples
0
0 1x3 1x3
0 1 7 3+ 1 2 3 is 2 9 6
9
2 2x3 2x3 2x3
2 2 3+ 2 2 2 is 4 4 5
4 -1 0 1 1 1 5 0 1
is =MMULT(array1,array2)
is =MMULT(,)
m by n n by p
3 1 3 0 0 * 1
4 2 4 0 0 0
0 5 1 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
ata in upper right element location.
n by p m by p
1 1 0 0 is 6 7 8 0 0
4 5 0 0 7 8 9 0 0
0 0 0 0 3 4 5 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
n by p m by p
0 0 0 0 is 3 0 0 0 0
0 0 0 0 4 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
Multiply 2 Matrices.
Enter data below ONLY! DO NOT, DO NOT, DO NOT enter data below
1x3 3x2 1x2
[ 1 2 3 ]*[ 1 0 ]= [ ( 1 )( 1 )+( 2 )( -2 )+( 3 )( 0 )
-2 3 ]
0 1 ]] =[ -3 9]
= [[ 17 16 ]
[ 22 19 ]]
= [[ 9 4 4]
[ 22 4 4 ]]
( 1 )( 0 )+( 2 )( 3 )+( 3 )( 1 )]
( 1 )( 1 )+( 4 )( 3 )+( 3 )( 1 )]
of each factor.
1 ) ]
1 ) ]]
Name _________________________________________
mathnstuff.com/math/algebra/qb/mayhs2/a2© 2007, A. Azzolino
First: Multiply the [A] matrix by its inverse matrix [I] listing the 2x2 product matrix.
1 0
=
0 1
Second: Set each of the cells of the prouct matrix equal to its corresponding cell
of the identity matrix
=1 =0
=0 =1
[I] =
[I] =
First: Multiply the [A] matrix by its inverse matrix [I] listing the 2x2 product matrix.
AI11+BI21 AI12+BI22 1 0
=
CI11+DI21 CI11+DI22 0 1
Second: Set each of the cells of the prouct matrix equal to its corresponding cell
of the identity matrix
AI11+BI21 =1 AI12+BI22 =0
CI11+DI21 =0 CI12+DI22 =1
D/(AD-BC) -B/(AD-BC)
[I] =
-C/(AD-BC) A/(AD-BC)
D/|A| - B/|A|
[I] = y=
-C/|A| A/|A|
= 1 D -B
|A| -C A
Cells are color coded for identification.
1B 0B
0D = 1D-0B x= 1D = 0D-1B
A B AD-BC A B AD-CB
C D C D
A 1 A 0
C 0 = 0A-1C y= C 1 = 1A-0C
A B AD-BC A B AD-CB
C D C D
3 by 3 inverse
a21i11+a22i21+a23i31 =0 a21i12+a22i22
a31i11+a32i21+a33i31 =0 a31i12+a32i22
This system has variables i11, i21, and i31. To solve for i1
a11i11+a12i21+a13i31 =1 a11
a21i11+a22i21+a23i31 =0 a21
a31i11+a32i21+a33i31 =0 a31
This system has variables i12, i22, i32. To solve for i1
a11i12+a12i22+a13i32 =0 a11
a21i12+a22i22+a23i32 =1 a21
a31i12+a32i22+a33i32 =0 a31
This system has variables i13, i23, and i33. To solve for i1
a11i13+a12i23+a13i33 =0 a11
a21i13Ia22i23+a23i33 =0 a21
a31i13+a32i23+a33i33 =1 a31
i12 i13 1 0 0
=
i22 i23 0 1 0
i32 i33 0 0 1
a11i13+a12i23+a13i33 1 0 0
=
a21i13Ia22i23+a23i33 0 1 0
a31i13+a32i23+a33i33 0 0 1
a11i12+a12i22+a13i32 =0 a11i13+a12i23+a13i33
a21i12+a22i22+a23i32 =1 a21i13Ia22i23+a23i33
a31i12+a32i22+a33i32 =0 a31i13+a32i23+a33i33
To solve for i11, i21, and i31, use this system. Use Cramer's rule to so
To solve for i12, i22, and i32, use this system. Use Cramer's Rule to s
D =
To solve for i13, i23, and i33, use this system. Use Cramer"s Rule to s
D =
3+a12i23+a13i33 =0
3Ia22i23+a23i33 =0
3+a32i23+a33i33 =1
4.Compete computatio
k1 rowA (k1)(rowA)
4 * 0 -1 1 -2 0 0 0 -4 4
plus
k2 rowB (k2)(rowB)
1 * 1 4 1 -1 0 0 1 4 1
(k1)(rowA)+(k2)(rowB)
1 0 5
3.Record desired transformations before beginning step 4.
5.Record the results here & recopy below.
Row1 2 1 1 0
Row2 -1 2 0 1 R2+R1-->R1
Row3
Row1 2 9 1 0
Row2 1 5 0 1 R1-R2-->R1
Row3
Row1 1 4 1 -1
Row2 1 5 0 1 R1-R2-->R2
Row3
Row1 1 4 1 -1
Row2 0 -1 1 -2 4R2+R1-->R1
Row3
Row1 1 0 5 -9
Row2 0 -1 1 -2 0R2-R1-->R2
Row3
Row1 1 0 5 -9
Row2 0 1 -1 2
Row3
row manipulation. 6.Verify by formula. Choose a 2x2 o
2 9
[A] = 1 5
det([A]) = |A| = 1
inv([A]) = 5 -9
ompete computation. -1 2
-8 0 0
-1 0 0
(rowA)+(k2)(rowB)
-9 0 0
ning step 4.
1.Original matrix.
Begin with a 2x2 or 3x3 matrix (entered in upper right corner at 1.).
2.Identity matrix
An appropriate identity matrix is provided in green (at 2.).
3.Record desired transformations before beginning step 4.
Attack each element, usually starting with any that happen to be 1 o
The goal is to change the element to the desired Identity eleme
The user must decide what row operation to perform.
The user may need to add additional arrays for manipulation.
4.Compete computation.
The spread sheet will complete the desired computation.
The user must recopy the edited array and repeat the process as ne
5.Record the results here & recopy below.
Note that the row operation notation is part of the answer. Save it.
6.Verify by formula. (Optional.)
The yellow cells are self-computing and state the spread sheet-com
The goal is to find the inverse of a matrix by
row manipulation and verify it by spread shee
Choose a 2x2 or a 3x3.
4 1 2
2 -1 2
[A] = 0 1 2
n (at 2.).
anipulation.
utation.
t the process as needed.
[[ 2 9 ] * [[ x11 ] = [[ 8]
[ 1 5 ]] [ x21 ]] [ 4 ]]
4
[X] = 0
det([A]) = |A| = 1
inv([A]) = 5 -9
-1 2
D/(AD-BC) -B/(AD-BC)
[I] =
-C/(AD-BC) A/(AD-BC)
Solve the System with Matrices
[[ -1 0 1 ] * [[ x11 ] = [[ 8]
[ -1 -0.5 2 ]] [ x21 ]] [ 4 ]]
1 0.25 0 2
-6
[X] = -7
4.5
det([A]) = |A| = 4
inv([A]) = [[ -1 0 1]
[ -1 -0.5 2 ]
[ 0.5 0.25 0 ]]
es by A to get
[[ -1 0 1 ] * [[ x11 ] = [[ 8]
[ -1 -0.5 1.5 ] [ x21 ]] [ 4 ]]
0.5 0.25 -0.25 ]] [ x31 ]] [ 2
-6
[X] = -7
4.5
det([A]) = |A| = 4
inv([A]) = [[ -1 0 1]
[ -1 -0.5 1.5 ]
[ 0.5 0.25 -0.25 ]]
"Scrap work" to inv[A]
Solve system by Cramer's Rule
x is -6 y is -7 z is
8 1 2
4 -1 2
x= 2 1 2 =
-1 1 2
2 -1 2
0 1 2
-1 8 2
2 4 2
y= 0 2 2 =
-1 1 2
2 -1 2
0 1 2
-1 1 8
2 -1 4
z= 0 1 2 =
-1 1 2
2 -1 2
0 1 2
8
4
2
4.5
determinant solution
-24 = -6
-28 = -7
18 = 4.5
4
Solve a System by Gauss-Jordan Elimination.
2.Compete computati
1.Record original coefficient & constant matrix. diagonal and 0s elsew
2 9 1 k1 rowA
1 5 0 4 * 0 -1 1 -2 0 = 0
plus
k2 rowB (k2)(rowB)
1 * 1 4 1 -1 0 = 1
Row1 (k1)(rowA)+(k2)
Row2 = 1
Row3
Row4
Row1
Row2
Row3
Row4
Row1
Row2
Row3
Row4
Row1
Row2
Row3
Row4
Row1
Row2
Row3
Row4
.Compete computation to place 1s on the major
iagonal and 0s elsewhere in the coefficient array.
(k1)(rowA) 2 9 1
-4 4 -8 0 1 5 0
plus 0
(k2)(rowB) 0
4 1 -1 0 3.Read solution.
(k1)(rowA)+(k2)(rowB)
0 5 -9 0