#18381: Cholesky decomposition should be real
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-7.2
Component: linear algebra | Resolution:
Keywords: | Merged in:
Authors: Vincent Delecroix | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/vdelecroix/18381 | c3db63db26a51c50344e7ecbac56dedd64e860c1
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dimpase):
Replying to [comment:14 vdelecroix]:
> It reflects the reality: the dense `RDF` case is handled by numpy. While
the Sage algorithm is not numerically stable (?) and should not be used
for non exact rings.
the reality is that while Sage does have code that can do Cholesky of
sparse RDF matrices, and even of sparse CDF matrices (hidden in CVXOPT,
that packages suitesparse with its cholmod), it just needs to be exposed
the way numpy dense matrices are exposed.
Anyhow, the error message is wrong, it should say that either the matrix
should be dense over RDF, or sparse/dense over an exact field.
--
Ticket URL: <http://trac.sagemath.org/ticket/18381#comment:15>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
