{"id":15446890,"url":"https://github.com/bgmp/matrixmultiplier","last_synced_at":"2025-07-25T02:34:16.237Z","repository":{"id":240975948,"uuid":"803947741","full_name":"BGMP/MatrixMultiplier","owner":"BGMP","description":"Matrix multiplication program written in Python, with asymptotic visualization in R","archived":false,"fork":false,"pushed_at":"2024-05-27T04:33:58.000Z","size":654,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-07-18T23:00:27.274Z","etag":null,"topics":["divide-and-conquer","latex","learn","matrix-multiplication","python","r","strassen"],"latest_commit_sha":null,"homepage":"","language":"R","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/BGMP.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-05-21T17:02:10.000Z","updated_at":"2024-07-10T14:15:16.000Z","dependencies_parsed_at":"2024-10-01T20:02:43.413Z","dependency_job_id":"0e914ea6-f255-438b-a174-0cad71def0a3","html_url":"https://github.com/BGMP/MatrixMultiplier","commit_stats":{"total_commits":27,"total_committers":1,"mean_commits":27.0,"dds":0.0,"last_synced_commit":"9c55e1acfc9fa5b1a9f2a91392d33fcf3cb988d2"},"previous_names":["bgmp/matrixmultiplier"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/BGMP/MatrixMultiplier","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BGMP%2FMatrixMultiplier","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BGMP%2FMatrixMultiplier/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BGMP%2FMatrixMultiplier/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BGMP%2FMatrixMultiplier/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BGMP","download_url":"https://codeload.github.com/BGMP/MatrixMultiplier/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BGMP%2FMatrixMultiplier/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266944482,"owners_count":24010487,"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","status":"online","status_checked_at":"2025-07-25T02:00:09.625Z","response_time":70,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["divide-and-conquer","latex","learn","matrix-multiplication","python","r","strassen"],"created_at":"2024-10-01T20:02:41.193Z","updated_at":"2025-07-25T02:34:16.185Z","avatar_url":"https://github.com/BGMP.png","language":"R","funding_links":[],"categories":[],"sub_categories":[],"readme":"MatrixMultiplier\n===\nThis project aims to compare three different algorithms for matrix multiplication by running them on different sizes of\nmatrices and comparing their execution times. The three algorithms are:\n\n* Naive (Traditional).\n* Divide and conquer.\n* Strassen's algorithm.\n\nThe project is written in Python and uses the `numpy` library for matrix operations.\n\n## Running\nAt the top of `main.py`, you will find the following:\n```python\nMATRIX_SIZE = [32, 64, 128, 256, 512, 1024] # n\n```\n\nYou may modify the *n* values to change the size of the matrices to be multiplied. The program will generate two random\nmatrices of size *n* x *n* for each of the values you provide, and then multiply them using the three algorithms\nmentioned above. \n\nTo run the program, first install the dependencies:\n```bash\npip install -r requirements.txt\n```\n\nThen run the main script:\n```bash\npython main.py\n```\n\nThe results are saved to a CSV file in the `data/` directory, which are then used to generate graphs with R. If you\nwant to generate the graphs, simply open `MatrixMultiplier.Rproj` with RStudio and run the script. The generated graphs\nwill look as follows:\n\n![image](img/TRADITIONAL_DR1_DR2_PLOT.png)\n\n## Dependencies\n### Python\n- [Python 3.8 or above](https://www.python.org/downloads/)\n- Python modules:\n  - numpy\n- I suggest using venv \u0026 pip for development \u0026 dependency management. (In case of Apple Silicon use conda)\n\n### R\n- [R 4.0 or above](https://cran.r-project.org/)\n\n## Notes\nThis project was written as part of the Masters in Computer Science course \"Advanced Data Structures and Algorithms\" at\nthe University of the Bío-Bío.\n\nSome of the TeX/PDF files are in Spanish, as the course was taught in Spanish, but I've made an effort to translate the\nrelevant parts to english.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbgmp%2Fmatrixmultiplier","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbgmp%2Fmatrixmultiplier","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbgmp%2Fmatrixmultiplier/lists"}