| Singular https://www.singular.uni-kl.de/forum/ |
|
| how easily can Singular derive intersections of polynomials? https://www.singular.uni-kl.de/forum/viewtopic.php?f=10&t=1661 |
Page 1 of 1 |
| Author: | Colin Rowat [ Sun Feb 10, 2008 12:53 am ] |
| Post subject: | how easily can Singular derive intersections of polynomials? |
Dear Singular users, I have been using Maple in an attempt to derive intersections of systems of two polynomials, each like: f_7(a,b,c)x^7 + ... + f_1(a,b,c)x + f_0(a,b,c) = 0; where a,b,c are each defined over [0,1] and the functions, f_i, are polynomial in a,b, and c. I am only interested in the x in [0,1]. (The problem is one in economics, as referred to on p.25 of Greuel and Pfister's "Singular and Applications".) Not having succeeded yet, I have been looking for alternative ways to do this, and have therefore discovered Singular. As my algebra is limited, I find it difficult to assess from the online manual and other supporting documentation whether (i) Singular can derive such intersections; and (ii) I will be able to use it without too much investment of time. Any guidance on either of these questions would be very much appreciated. (I am happy to work with x,a,b,c in the rationals rather than the reals.) Thank you in advance, Colin Rowat |
|
| Author: | greuel [ Fri Jun 20, 2008 6:15 pm ] |
| Post subject: | |
See reply to factoring lists from Mon Jun 09, 2008 2:54 am |
|
| Page 1 of 1 | All times are UTC + 1 hour [ DST ] |
| Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group http://www.phpbb.com/ |
|