#12101: infinite recursion with exp on sparse matrix
---------------------------------------+------------------------------------
Reporter: benjamin.peterson | Owner: jason, was
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.4
Component: linear algebra | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers: Burcin Erocal
Authors: Karl-Dieter Crisman | Merged in:
Dependencies: | Stopgaps:
---------------------------------------+------------------------------------
Comment (by tscrim):
Replying to [comment:3 burcin]:
> I don't think silently converting the sparse input matrix to a dense one
is a good idea. We should define an `exp()` method for sparse symbolic
matrices to avoid this infinite recursion.
My 2 cents; converting to a dense matrix is something to be avoided
because (in general) it requires substantial memory allocation (ex. take a
`1000x1000` matrix with 2 (non-zero) entries). Thus I would rather see the
`exp()` implemented for sparse (symbolic) matrices and return a sparse
matrix.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12101#comment:4>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
