HP 50g User Manual page 362

While performing pivoting in a matrix elimination procedure, you can improve
the numerical solution even more by selecting as the pivot the element with the
largest absolute value in the column and row of interest. This operation may
require exchanging not only rows, but also columns, in some pivoting
operations. When row and column exchanges are allowed in pivoting, the
procedure is known as full pivoting.
When exchanging rows and columns in partial or full pivoting, it is necessary to
keep track of the exchanges because the order of the unknowns in the solution
is altered by those exchanges. One way to keep track of column exchanges in
partial or full pivoting mode, is to create a permutation matrix P = I
beginning of the procedure. Any row or column exchange required in the
augmented matrix A
respectively, in the permutation matrix. When the solution is achieved, then,
we multiply the permutation matrix by the unknown vector x to obtain the order
of the unknowns in the solution. In other words, the final solution is given by
P x = b', where b' is the last column of the augmented matrix after the solution
has been found.
Example of Gauss-Jordan elimination with full pivoting
Let's illustrate full pivoting with an example.
equations using full pivoting and the Gauss-Jordan elimination procedure:
The augmented matrix and the permutation matrix are as follows:
A
Store the augmented matrix in variable AAUG, then press ‚ @AAUG to get a
copy in the stack. We want to keep the CSWP (Column Swap) command
readily available, for which we use: ‚N~~cs~ (find CSWP),
@@OK@@. You'll get an error message, press $, and ignore the message.
Next, get the ROW menu available by pressing: „Ø @) C REAT @) @ ROW@.
is also registered as a row or column exchange,
aug
X + 2Y + 3Z = 2,
2X +
8X +16Y- Z = 41.
1 2
⎡
⎢
2 0
⎢
aug
⎢
8 16
⎣
Solve the following system of
3Z = -1,
3 2
⎤
⎥
3 1 , P
⎥
⎥
1 41
⎦
n n
1 0 0
⎡ ⎤
⎢ ⎥
0 1 0 .
⎢ ⎥
⎢ ⎥
0 0 1
⎣ ⎦
, at the
Page 11-35