{"id":26385276,"url":"https://github.com/madhavjivrajani/linearalgebra","last_synced_at":"2026-06-15T20:31:32.110Z","repository":{"id":137699464,"uuid":"238468030","full_name":"MadhavJivrajani/LinearAlgebra","owner":"MadhavJivrajani","description":"Assignment for UE18MA251, Linear Algebra","archived":false,"fork":false,"pushed_at":"2020-03-15T08:23:36.000Z","size":83,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-04-08T05:29:25.375Z","etag":null,"topics":["equations","factorize","gaussian","linearalgebra","matplotlib","python"],"latest_commit_sha":null,"homepage":null,"language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/MadhavJivrajani.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2020-02-05T14:21:46.000Z","updated_at":"2020-06-05T20:21:03.000Z","dependencies_parsed_at":"2023-05-18T00:30:55.949Z","dependency_job_id":null,"html_url":"https://github.com/MadhavJivrajani/LinearAlgebra","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/MadhavJivrajani/LinearAlgebra","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MadhavJivrajani%2FLinearAlgebra","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MadhavJivrajani%2FLinearAlgebra/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MadhavJivrajani%2FLinearAlgebra/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MadhavJivrajani%2FLinearAlgebra/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MadhavJivrajani","download_url":"https://codeload.github.com/MadhavJivrajani/LinearAlgebra/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MadhavJivrajani%2FLinearAlgebra/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34379915,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-15T02:00:07.085Z","response_time":63,"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":["equations","factorize","gaussian","linearalgebra","matplotlib","python"],"created_at":"2025-03-17T07:41:22.775Z","updated_at":"2026-06-15T20:31:32.091Z","avatar_url":"https://github.com/MadhavJivrajani.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LinearAlgebra\nAssignments for UE18MA251, Linear Algebra\nCoded purely from scratch using Python 3.6.x. \n\n## Assignment - 1\nGiven a matrix A for the system of equations `Ax = b`\n- Display, number of equations/rows, number of unknowns/columns, and rank of the matrix. (Use built in functions if required)\n- Is the matrix singular (if it is a square matrix)?\n- For a given `b`, will the system `Ax = b` have\n  - Unique solution.\n  - Infinitely many solutions\n  - No Solution.\n\n- If it has a unique solution display the solution.\n\n## Assignment 2\n- For a given matrix A which has a unique solution for Ax=b for any b,  \n  test whether the LU factorization method is faster than the Gaussian Elimination method.\n\nRun a test in this manner:\n    -   First read a matrix A with full rank/full column rank.\n    -   Generate a hundred random b vectors.\n    -   Find a solution for each b.\n    -   Note down how long this approach takes.\n\n-   Factorize A to LU.\n-   Generate a hundred random b vectors.\n-   Find a solution for each b.\n-   Record how long does this new approach take.\n\nCheck if the claim that the first approach takes `100*O(n3/3 )` and the second approach takes `O(n3/3 ) + 99*O(n2)` is true.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmadhavjivrajani%2Flinearalgebra","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmadhavjivrajani%2Flinearalgebra","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmadhavjivrajani%2Flinearalgebra/lists"}