Calculate of modular inverse matrices using Gauss-Jacques algorithm sized n x n for applications in numerical analysis.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
Gauss-Jacques algorithm gets the modular inverse of a matrix. This algorithm does not use neither determinants nor the adjoint matrix and is very useful for matrices of any size.
Example:
n = 10; % size of the matrix
K = randi(100,n,n); % generate a randon matrix with size 'n'
m = 89; % the module must be a prime number
[InvMod, I] = gauss_jacques(K, m);
References:
https://www.uaq.mx/investigacion/revista_ciencia@uaq/ArchivosPDF/v11-n1/art14_numerada-VF.pdf
https://savannah.gnu.org/patch/?9691
https://www.npmjs.com/package/gauss-jacques
Cite As
D. Cantón (2026). Gauss-Jacques Method (https://github.com/dCantonE/gauss-jacques), GitHub. Retrieved .
General Information
- Version 1.0.4 (14.1 KB)
-
View License on GitHub
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
Versions that use the GitHub default branch cannot be downloaded
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.4 | update summary |
