#6258: Improve accuracy of graph eigenvalues
--------------------------+-------------------------------------------------
Reporter: rbeezer | Owner: rbeezer
Type: defect | Status: new
Priority: minor | Milestone: sage-4.0.2
Component: graph theory | Keywords:
Reviewer: | Author:
Merged: |
--------------------------+-------------------------------------------------
Eigenspaces and eigenvalues of graphs are computed by converting the
adjacency matrix to have RDF as the base ring, but there are now better
routines in place for eigenvalues of integer matrices, so the
{{{eigenspaces()}}} and {{{eigenvalues()}}} methods should be using those.
At present, the approximate values of the eigenvalues lead to eigenspaces
"splitting" into pieces (i.e. several eigenspaces that should all be one),
so in that regard current results are inaccurate.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6258>
Sage <http://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
-~----------~----~----~----~------~----~------~--~---
