#13417: Improved iteration on finite \ZZ-submodules and vector spaces over
finite
fields
---------------------------------------------------------+------------------
Reporter: tfeulner | Owner:
AlexGhitza
Type: enhancement | Status:
needs_review
Priority: major | Milestone:
sage-5.5
Component: algebra | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Thomas Feulner, Punarbasu Purkayastha | Merged in:
Dependencies: | Stopgaps:
---------------------------------------------------------+------------------
Comment (by tfeulner):
Replying to [comment:10 ppurka]:
> By "norm" I meant that in usual places like textbooks, the convention
followed is to have the first nonzero element as 1. Am I right?
Well, this is at least the standard within Sage, so we should follow this.
>
> Echelonizing the basis is too much computations I think. All that is
required is to determine the first nonzero element of a vector and
multiply by its inverse.
I do not understand why this should be too complicated, as far as I
understand you would suggest to normalize all computed vectors (by the way
there is already a function ```v.normalize()``` doing exactly the same)?
But there are (q^k^-1)/(q-1) of them, while you have only to echelonize a
(k x n) matrix over F,,q,,.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13417#comment:11>
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.
