Timeline for Recommendations for binomial system solver
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Feb 21, 2013 at 3:46 | vote | accept | ssquidd | ||
Feb 19, 2013 at 7:37 | answer | added | Thomas Kahle | timeline score: 3 | |
Feb 19, 2013 at 7:10 | comment | added | Thomas Kahle | I'm writing a symbolic computation answer but you may want to try numerical algebraic geometry software such as Bertini. | |
Feb 19, 2013 at 2:19 | comment | added | Dustin Cartwright | If you're using the binomialPrimaryDecomposition function in the Binomials package, then it is doing two things, which may be contributing to the computation time, but seem not be relevant to you. First, it computes all primary components, even when one or more coordinates is zero. Second, it is finding the defining ideals of the components, as opposed to just the monomial parametrization. Have you tried the partialCharacter command? It's not exactly what you want, but I think it gets you most of the way towards a parametrization of the primary components in the torus. | |
Feb 19, 2013 at 0:53 | history | asked | ssquidd | CC BY-SA 3.0 |