{"id":19876696,"url":"https://github.com/dirktoewe/srrqr_bin_py","last_synced_at":"2026-06-10T19:31:37.153Z","repository":{"id":176082583,"uuid":"234295233","full_name":"DirkToewe/srrqr_bin_py","owner":"DirkToewe","description":"Binary-Search Strong Rank-Revaling QR Decomposition Implemented in Python","archived":false,"fork":false,"pushed_at":"2020-01-16T10:33:26.000Z","size":92,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-20T20:29:54.965Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/DirkToewe.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":"2020-01-16T10:29:51.000Z","updated_at":"2024-03-14T10:37:49.000Z","dependencies_parsed_at":null,"dependency_job_id":"895de66c-e166-4a13-ac5b-519fe000dfd2","html_url":"https://github.com/DirkToewe/srrqr_bin_py","commit_stats":null,"previous_names":["dirktoewe/srrqr_bin_py"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/DirkToewe/srrqr_bin_py","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DirkToewe%2Fsrrqr_bin_py","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DirkToewe%2Fsrrqr_bin_py/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DirkToewe%2Fsrrqr_bin_py/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DirkToewe%2Fsrrqr_bin_py/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/DirkToewe","download_url":"https://codeload.github.com/DirkToewe/srrqr_bin_py/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DirkToewe%2Fsrrqr_bin_py/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34168086,"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-10T02:00:07.152Z","response_time":89,"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":[],"created_at":"2024-11-12T16:33:57.991Z","updated_at":"2026-06-10T19:31:37.137Z","avatar_url":"https://github.com/DirkToewe.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Introduction\nThis Python package is a proof-of-concept implementation of a binary search strong rank-revealing QR decomposition (`SRRQR_bin`).\nIt is an improved version of the strong rank-revealing QR decomposition (`SRRQR_l2r`), which is described as Algorithm 4 in:\n\n```\n Ming Gu, Stanley C. Eisenstat,\n\"EFFICIENT ALGORITHMS FOR COMPUTING A STRONG RANK-REVEALING QR FACTORIZATION\"\n https://math.berkeley.edu/~mgu/MA273/Strong_RRQR.pdf\n```\n\n`SRRQR_l2r` tries out every rank k from left (k=0) to right (k=min(m,n)) in order to find the correct rank of the matrix.\nAs the name already indicates, the binary search version `SRRQR_bin` uses binary search to find the actual rank. This greatly\nreduces the number of \"strong\" column swaps required for larger matrices. While the threshold `f` cannot be constant if `SRRQR_l2r`\nis to achieve `O(m^2*n)` performance, `SRRQR_bin` _should_ work with constant values for `f`.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdirktoewe%2Fsrrqr_bin_py","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdirktoewe%2Fsrrqr_bin_py","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdirktoewe%2Fsrrqr_bin_py/lists"}