pulkit Posted August 22, 2004 Posted August 22, 2004 I am building a software package that converts 2-d drawings into 3-d objects. In the process, I am in the need of knowing an algorithm to determine the rank of a matrix. I am dealing with a 4x3 matrix and need a method (that can be easily coded into a computer programme) which would mechanically compute the rank of such a matrix. I am unable to develop any such method so can anyone help me ? I must add that determination of rank using the definition of rank seems a bit too inefficient to code.
Aeschylus Posted August 22, 2004 Posted August 22, 2004 Use Gaussian elimination to determine the rank.
pulkit Posted August 22, 2004 Author Posted August 22, 2004 Can gaussian elimination also be used to solve a set of simultaneous linear equations ?
Aeschylus Posted August 22, 2004 Posted August 22, 2004 Can gaussian elimination also be used to solve a set of simultaneous linear equations ? indeed, infact it's usually introduced as a method of solving s. linear equations.
Treadstone Posted August 22, 2004 Posted August 22, 2004 to save time you could also set up some conditional statements to see if the matrix is already in row reduced echelon form, then just count pivots...that way you dont run guassian elim every time. nathan
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now