{"id":20418528,"url":"https://github.com/willnode/n-matrix-programmer","last_synced_at":"2025-04-12T17:34:39.135Z","repository":{"id":52811391,"uuid":"93487011","full_name":"willnode/N-Matrix-Programmer","owner":"willnode","description":"A software to write an optimized code that calculates inverse and determinant of N by N matrix.","archived":false,"fork":false,"pushed_at":"2022-05-29T05:35:29.000Z","size":277,"stargazers_count":46,"open_issues_count":1,"forks_count":8,"subscribers_count":5,"default_branch":"master","last_synced_at":"2025-03-26T12:01:33.268Z","etag":null,"topics":["calculator","determinant","matrix"],"latest_commit_sha":null,"homepage":"https://stackoverflow.com/a/44446912/3908409","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/willnode.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2017-06-06T07:05:30.000Z","updated_at":"2025-02-27T16:53:12.000Z","dependencies_parsed_at":"2022-08-17T15:15:15.489Z","dependency_job_id":null,"html_url":"https://github.com/willnode/N-Matrix-Programmer","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willnode%2FN-Matrix-Programmer","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willnode%2FN-Matrix-Programmer/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willnode%2FN-Matrix-Programmer/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willnode%2FN-Matrix-Programmer/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/willnode","download_url":"https://codeload.github.com/willnode/N-Matrix-Programmer/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248605818,"owners_count":21132240,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["calculator","determinant","matrix"],"created_at":"2024-11-15T06:33:31.724Z","updated_at":"2025-04-12T17:34:39.111Z","avatar_url":"https://github.com/willnode.png","language":"C#","readme":"# N-Matrix-Programmer\nA program to create a program that calculates inverse and determinant of N by N matrix.\n\n\u003e UPDATE (2022): I build a collection of libraries that does this for you: https://github.com/willnode/matrix-inversion\n\n![Screenshot](Info/Screenshot.png)\n\n## Background\n\nThis program is created for programmers who want to write the program which will do inverse and determinant of N by N matrix.\n\nFor those who need it, it creates the code for you automatically in an instant, therefore saves you hours (even days) of time.\n\nThe output syntaxes and N-order can be changed via code or command-line arguments.\n\n## Output samples\nHere'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).\n\n## Warning\nThe 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.\n\nHowever, for N\u003e=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.\n\n## License\nThe program and its generated code are both licensed as [MIT](LICENSE)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwillnode%2Fn-matrix-programmer","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwillnode%2Fn-matrix-programmer","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwillnode%2Fn-matrix-programmer/lists"}