Opened 7 years ago
Closed 4 years ago
#19074 closed enhancement (wontfix)
Conjugate Gradient method for solving modular sparse matrices
| Reported by: | Kartik Venkatram | Owned by: | |
|---|---|---|---|
| Priority: | major | Milestone: | sage-duplicate/invalid/wontfix |
| Component: | linear algebra | Keywords: | sparse, matrix |
| Cc: | Merged in: | ||
| Authors: | Kartik Venkatram | Reviewers: | |
| Report Upstream: | N/A | Work issues: | |
| Branch: | Commit: | ||
| Dependencies: | Stopgaps: |
Status badges
Description (last modified by )
Implementation of vanilla conjugate gradient method for solving sparse matrices mod N. Should be faster than built-in methods for matrices that are highly sparse. See https://en.wikipedia.org/wiki/Conjugate_gradient_method for details.
--Note: possibly superior functionality available in unexposed function _solve_right_nonsingular_square, will verify before continuing.--
Change History (3)
comment:1 Changed 7 years ago by
| Description: | modified (diff) |
|---|---|
| Milestone: | sage-6.9 → sage-duplicate/invalid/wontfix |
| Status: | new → needs_review |
comment:2 Changed 7 years ago by
| Status: | needs_review → needs_info |
|---|
comment:3 Changed 4 years ago by
| Resolution: | → wontfix |
|---|---|
| Status: | needs_info → closed |
No update in 4 years and nobody seems to know what this means. Please feel free to reopen or open a new ticket if you intend to work on this.
Note: See
TracTickets for help on using
tickets.
What is this ticket?