Skip to content
/ matrix-inverse-gj Public

Compute the inverse of a matrix using the Gauss-Jordan method.

2 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

derekharrison/matrix-inverse-gj

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

39 Commits

.gitignore

.gitignore

 
 

README.md

README.md

 
 

gauss_jordan_algorithm.pdf

gauss_jordan_algorithm.pdf

 
 

lib_gauss.cpp

lib_gauss.cpp

 
 

lib_gauss.hpp

lib_gauss.hpp

 
 

lib_mat.cpp

lib_mat.cpp

 
 

lib_mat.hpp

lib_mat.hpp

 
 

lib_mem.cpp

lib_mem.cpp

 
 

lib_mem.hpp

lib_mem.hpp

 
 

lib_sort.cpp

lib_sort.cpp

 
 

lib_sort.hpp

lib_sort.hpp

 
 

main.cpp

main.cpp

 
 

user_types.hpp

user_types.hpp

 
 

Repository files navigation

matrix-inverse-gj

The Gauss-Jordan method is implemented with row sorting instead of row swapping to compute the inverse of a matrix in O(n^3) time. Computation has been validated through test-cases and comparison with other methods implementing the Gauss-Jordan method.

About

Compute the inverse of a matrix using the Gauss-Jordan method.

Topics

linear-algebra mergesort gauss-elimination gaussian-elimination gaussian-elimination-algorithm gauss-jordan merge-sort linear-system-solver matrix-inversion matrix-inverse

Resources

Readme
Activity

Stars

2 stars

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages