Determining Pivot Columns in a Matrix - Fred's Question

mathboy20
Messages
27
Reaction score
0
Hi

I got simple question. How is it that determain if a column in matrix is a pivot column?

Sincerely

Fred
 
Physics news on Phys.org
mathboy20 said:
I got simple question. How is it that determain if a column in matrix is a pivot column?

Are you asking about gaussian reduction, the simplex method, or something else?
 
NateTG said:
Are you asking about gaussian reduction, the simplex method, or something else?

What I'm asking given a matrix

A= [[1,2,2,0,1,1][0,i,0,0,1,2][0,0,0,0,i,0][0,0,1,2,2i]]


Which in echelonform gives

A ~[[1,2,2,0,1,1][0,1,0,0,-i,-2i][0,0,1,2,0,2i][0,0,0,0,1,0]]

My question is the pivot column of this matrix aren't they

column 1,2,5,6 ??

Since the definition a pivot position is is the column where there is a non-zero entry above a zero entry??

Best Regards
Mathboy20
 
For row echelon form, the pivot columns where there is a non-zero value to the right of leading zeros.

In the example you give, the pivot columns would be 1,2,3, and 5.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top