#19074: Conjugate Gradient method for solving modular sparse matrices
----------------------------+----------------------------------------------
Reporter: kartikv | Owner:
Type: | Status: needs_review
enhancement | Milestone: sage-duplicate/invalid/wontfix
Priority: major | Resolution:
Component: linear | Merged in:
algebra | Reviewers:
Keywords: sparse, | Work issues:
matrix | Commit:
Authors: Kartik | Stopgaps:
Venkatram |
Report Upstream: N/A |
Branch: |
Dependencies: |
----------------------------+----------------------------------------------
Changes (by kartikv):
* status: new => needs_review
* milestone: sage-6.9 => sage-duplicate/invalid/wontfix
Old description:
> 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.
New description:
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.--
--
--
Ticket URL: <http://trac.sagemath.org/ticket/19074#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
