Gauss-Jordan Elimination
Describe your change:
This pull request adds a complete implementation of the Gauss–Jordan elimination algorithm for solving systems of linear equations of the form Ax= b . The function reduces the coefficient matrix to Reduced Row Echelon Form (RREF) while applying the same transformations to the right-hand-side vector.
Key highlights of the change:
-
Implements a robust algorithm with pivot detection, row swaps, normalization, and elimination
-
Handles both consistent and singular systems gracefully
-
Performs validation to ensure input shape compatibility
-
Includes doctests that verify correctness.
-
Written to be readable and educational, aligning with the goals of TheAlgorithms/Python repository.
This function is a core algorithm in linear algebra and complements existing matrix utilities in the repository.
- [x] Add an algorithm?
- [ ] Fix a bug or typo in an existing algorithm?
- [x] Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
- [ ] Documentation change?
Checklist:
- [x] I have read CONTRIBUTING.md.
- [x] This pull request is all my own work -- I have not plagiarized.
- [x] I know that pull requests will not be merged if they fail the automated tests.
- [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
- [x] All new Python files are placed inside an existing directory.
- [x] All filenames are in all lowercase characters with no spaces or dashes.
- [x] All functions and variable names follow Python naming conventions.
- [x] All function parameters and return values are annotated with Python type hints.
- [x] All functions have doctests that pass the automated testing.
- [x] All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
- [ ] If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".