#11772: improving error reporting of random_matrix
------------------------------+---------------------------------------------
Reporter: dimpase | Owner: jason, was
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.7.2
Component: linear algebra | Keywords:
Work_issues: | Upstream: N/A
Reviewer: Rob Beezer | Author:
Merged: | Dependencies:
------------------------------+---------------------------------------------
Comment(by dimpase):
Replying to [comment:7 dimpase]:
> I'd say this has either to be re-done, or scrapped...
and there are sound mathematical reasons behind this, too. E.g. if you ask
for a random rank k matrix of size kxn, with small entries, this already
means that you need to sample in a hypercube, and I leave it for people
with better working knowledge of this range of problems to figure out how
to go about it.
For instance, if you impose upper_bound=1, you have just 3^n choices of
vectors, and I don't know which proportion of k-subsets of such vectors
will correspond to linearly independent ones, nor what uniformly(?) random
such a subset should be...
The current code is just a dirty hack, and it should at least have a limit
on the number of tries done before giving up!
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11772#comment:8>
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.
