Home > Matrix & Vector calculators > Rank of matrix example

3. Rank of matrix example ( Enter your problem )
  1. Example `[[8,-6,2],[-6,7,-4],[2,-4,3]]`
  2. Example `[[3,2,4],[2,0,2],[4,2,3]]`
  3. Example `[[1,1,1],[-1,-3,-3],[2,4,4]]`
  4. Example `[[2,3],[4,10]]`
Other related methods
  1. Transforming matrix to Row Echelon Form
  2. Transforming matrix to Reduced Row Echelon Form
  3. Rank of matrix
  4. Characteristic polynomial of matrix
  5. Eigenvalues
  6. Eigenvectors (Eigenspace)
  7. Triangular Matrix
  8. LU decomposition using Gauss Elimination method of matrix
  9. LU decomposition using Doolittle's method of matrix
  10. LU decomposition using Crout's method of matrix
  11. Diagonal Matrix
  12. Cholesky Decomposition
  13. QR Decomposition (Gram Schmidt Method)
  14. QR Decomposition (Householder Method)
  15. LQ Decomposition
  16. Pivots
  17. Singular Value Decomposition (SVD)
  18. Moore-Penrose Pseudoinverse
  19. Power Method for dominant eigenvalue
  20. Determinant by gaussian elimination
  21. Expanding determinant along row / column
  22. Determinants using montante (bareiss algorithm)
  23. Leibniz formula for determinant
  24. determinants using Sarrus Rule
  25. determinants using properties of determinants
  26. Row Space
  27. Column Space
  28. Null Space

3. Example `[[1,1,1],[-1,-3,-3],[2,4,4]]`
(Previous example)
4. Characteristic polynomial of matrix
(Next method)

4. Example `[[2,3],[4,10]]`





Find Matrix Rank ...
`[[2,3],[4,10]]`


Solution:
 Rank 
`2``3`
`4``10`


Now, reduce this matrix
interchanging rows `R_1 harr R_2`

 = 
`4``10`
`2``3`


`R_2 larr R_2-1/2xx R_1`

 = 
`4``10`
`0``-2`


The rank of a matrix is the number of non all-zeros rows
`:. Rank = 2`


This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then Submit Here



3. Example `[[1,1,1],[-1,-3,-3],[2,4,4]]`
(Previous example)
4. Characteristic polynomial of matrix
(Next method)





Share this solution or page with your friends.
 
 
Copyright © 2025. All rights reserved. Terms, Privacy
 
 

.