https://github.com/willnode/n-matrix-programmer
A software to write an optimized code that calculates inverse and determinant of N by N matrix.
https://github.com/willnode/n-matrix-programmer
calculator determinant matrix
Last synced: 3 months ago
JSON representation
A software to write an optimized code that calculates inverse and determinant of N by N matrix.
- Host: GitHub
- URL: https://github.com/willnode/n-matrix-programmer
- Owner: willnode
- License: mit
- Created: 2017-06-06T07:05:30.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2022-05-29T05:35:29.000Z (about 3 years ago)
- Last Synced: 2025-03-26T12:01:33.268Z (3 months ago)
- Topics: calculator, determinant, matrix
- Language: C#
- Homepage: https://stackoverflow.com/a/44446912/3908409
- Size: 271 KB
- Stars: 46
- Watchers: 5
- Forks: 8
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# N-Matrix-Programmer
A program to create a program that calculates inverse and determinant of N by N matrix.
> UPDATE (2022): I build a collection of libraries that does this for you: https://github.com/willnode/matrix-inversion
## Background
This program is created for programmers who want to write the program which will do inverse and determinant of N by N matrix.
For those who need it, it creates the code for you automatically in an instant, therefore saves you hours (even days) of time.
The output syntaxes and N-order can be changed via code or command-line arguments.
## Output samples
Here's one of output in valid C# code: [1x1](Info/Matrix_1x1.txt) [2x2](Info/Matrix_2x2.txt) [3x3](Info/Matrix_3x3.txt) [4x4](Info/Matrix_4x4.txt) [5x5](Info/Matrix_5x5.txt) [6x6](Info/Matrix_6x6.txt) [7x7](Info/Matrix_7x7.txt) [8x8](Info/Matrix_8x8.txt) [9x9](Info/Matrix_9x9.txt) [10x10](Info/Matrix_10x10.txt).
## Warning
The computation time (including output code size and processing memory) is [O(N!N^3)](http://www.cg.info.hiroshima-cu.ac.jp/~miyazaki/knowledge/teche23.html) as its complexity always increased over N.
However, for N>=4 The output steps is cached in local variables progressively for every (N-1), therefore the computation time is only O(N!), making the most efficient code that you'll ever see.
## License
The program and its generated code are both licensed as [MIT](LICENSE)