#11556: Linear transformations, built from free module morphisms
------------------------------+---------------------------------------------
Reporter: rbeezer | Owner: jason, was
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.7.2
Component: linear algebra | Keywords:
Work_issues: | Upstream: N/A
Reviewer: Martin Raum | Author: Rob Beezer
Merged: | Dependencies: #11552, #11553
------------------------------+---------------------------------------------
Comment(by mraum):
There is one thing left. Sorry, for this, but I probably wasn't very
precise. In 2. you added a bit more explanation, but I was referring to
the fact that the keyword side only influences matrices. Many lines above
there is one example that demonstrates how it works. The sentence that I
referred to is placed before a series of examples dealing with lambda
expressions and symbolic functions.
Do I get this wrong?
Concerning the linear polynomials you are probably right. I thought about
something like extracting linear coefficients and then trying to recombine
them. But that would have a great impact on performance. Also, lambda
expressions cannot be tested for linearity either.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11556#comment:10>
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.
