I have a fixed number of 0 eigenvalues, and no real guarantee that the rest will be more than δ away for any δ. I wouldn't mind only recomputing close ones exactly, if I can bound the error so I know I won't miss any. I know that having more than one positive eigenvalues will be very rare, if it ever happens, but I really don't want to miss any of those cases.
On Tuesday, 21 May 2013 08:53:14 UTC-4, Jason Grout wrote: > > On 5/21/13 7:39 AM, Theo Belaire wrote: > > I haven't explicitly set the ring it's working over, but all the entries > > of the matrix are integral. > > Are your eigenvalues guaranteed to be a little away from 0, so you could > use numeric approximations? If so, computing the eigenvalues over the > RDF field, which uses some numeric approximation algorithms, may be much > faster than computing roots of integral characteristic polynomials. > > Thanks, > > Jason > > > -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at http://groups.google.com/group/sage-support?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
