[sage-support] Factoring denominator of a rational function
I have a rational function P(x)/Q(x) with numerators and denominators of very large degree. From the context I know that a certain polynomial p(x) should divide the denominator. If I multiply the numerator by p(x) giving p(x)*P(x)/Q(x) how do I get sage to cancel p(x) with the factor in Q(x)? In other words, how do I get sage to simplify when I work with rational functions. Everything I've tried either doesn't work or just sits there forever. -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] Re: Factoring denominator of a rational function
I should have given the original full context. These polynomials P,Q, and p are all in Z[x1,...,xn]. They are all multivariate. On Sep 3, 8:54 pm, Cary Cherng wrote: > I have a rational function P(x)/Q(x) with numerators and denominators > of very large degree. From the context I know that a certain > polynomial p(x) should divide the denominator. If I multiply the > numerator by p(x) giving p(x)*P(x)/Q(x) how do I get sage to cancel > p(x) with the factor in Q(x)? In other words, how do I get sage to > simplify when I work with rational functions. Everything I've tried > either doesn't work or just sits there forever. -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] Re: Factoring denominator of a rational function
And thats another problem. How do I tell sage to give me the denominator of this rational function? On Sep 4, 3:25 am, "ma...@mendelu.cz" wrote: > What about to use polynomial division to get polynomial q=Q/p and then > return P/q ? > > I do not remember the command for polynomial division, but should be > in the manual or help. > > Robert > > On 4 zář, 05:54, Cary Cherng wrote: > > > > > I have a rational function P(x)/Q(x) with numerators and denominators > > of very large degree. From the context I know that a certain > > polynomial p(x) should divide the denominator. If I multiply the > > numerator by p(x) giving p(x)*P(x)/Q(x) how do I get sage to cancel > > p(x) with the factor in Q(x)? In other words, how do I get sage to > > simplify when I work with rational functions. Everything I've tried > > either doesn't work or just sits there forever. -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] Re: Factoring denominator of a rational function
.denominator() gave me 1. Sage prints out the rational function as R1 + .. + R2 where Ri is a rational function and each having a different denominator. Sage doesn't seem to be automatically writing this as one fraction with a common denominator, could that be the reason it is returning 1 for the denominator? On Sep 4, 2:06 pm, "Justin C. Walker" wrote: > On Sep 4, 2010, at 13:54 , Cary Cherng wrote: > > > And thats another problem. How do I tell sage to give me the > > denominator of this rational function? > > In general, the .denominator and .numerator methods will (should) give > you the components of a "rational" element. > > HTH > > Justin > > -- > Justin C. Walker, Curmudgeon at Large > Institute for the Absorption of Federal Funds > --- > If it weren't for carbon-14, I wouldn't date at all. > --- -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] Re: Factoring denominator of a rational function
Ok i think I've resolved my problems by avoiding var for declaring variables and instead using R. = PolynomialRing(QQ) -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] Testing if polynomial is in ideal
Given p_i and q in Q[x_1,...,x_n] I want to see if q is in the ideal (p1,...,pm). Does sage have easy support for this? -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] Re: Testing if polynomial is in ideal
This works but is too slow for more complicated examples. Is there a way to speed up "x in I" for much bigger examples? Or does this already use the fastest algorithm based on groebner basis or something else. On Sep 6, 9:22 pm, Alex Ghitza wrote: > On Mon, 6 Sep 2010 20:42:43 -0700 (PDT), Cary Cherng > wrote: > > Given p_i and q in Q[x_1,...,x_n] I want to see if q is in the ideal > > (p1,...,pm). Does sage have easy support for this? > > Is this what you're looking for: > > sage: R. = QQ[] > sage: I = R.ideal(x^2, y) > sage: x^2*y+y^2 in I > True > sage: x in I > False > > Best, > Alex > > -- > Alex Ghitza --http://aghitza.org/ > Lecturer in Mathematics -- The University of Melbourne -- Australia -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] Re: Testing if polynomial is in ideal
nevermind I solved my problem. On Sep 7, 5:49 pm, Cary Cherng wrote: > This works but is too slow for more complicated examples. Is there a > way to speed up "x in I" for much bigger examples? Or does this > already use the fastest algorithm based on groebner basis or something > else. > > On Sep 6, 9:22 pm, Alex Ghitza wrote: > > > > > On Mon, 6 Sep 2010 20:42:43 -0700 (PDT), Cary Cherng > > wrote: > > > Given p_i and q in Q[x_1,...,x_n] I want to see if q is in the ideal > > > (p1,...,pm). Does sage have easy support for this? > > > Is this what you're looking for: > > > sage: R. = QQ[] > > sage: I = R.ideal(x^2, y) > > sage: x^2*y+y^2 in I > > True > > sage: x in I > > False > > > Best, > > Alex > > > -- > > Alex Ghitza --http://aghitza.org/ > > Lecturer in Mathematics -- The University of Melbourne -- Australia -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] Test if p(x) is in a ring generated by polynomials
I am not familiar with algebraic geometry or its terminology and new to sage. p_1,...p_n and q are elements of Z[x_1,...,x_n]. In my context I have some evidence that q can be written as something like q = p_1*p_2 + ... + p_5*p_6. In other words q is a degree 2 polynomial in the p_i's. Can Sage find out if q can be written in terms of the p_i's? -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] Re: Test if p(x) is in a ring generated by polynomials
Suppose I form the row matrix: M = [ (p_1*p_2, .., p_i*p_j) ] and then try looking for a column vector x satifying M*x = q where the elements of x are integers, hopefully 1 or -1. If I tried this approach how would I get sage to only consider integer vectors x as solutions. On Sep 8, 6:20 am, john_perry_usm wrote: > Are you asking whether q=p_1*p_2+...+p_5*p_6? If so, you can simply > construct q and the p_i, then test for equality: > > sage: q == p_1*p_2 + ... + p_5*p_6 > > >> True (or False, depending) > > (you would fill in the ellipsis with the form you want, which is not > obvious to me from what you've written). > > If instead you want to know if q is *some* linear combination of > p_1*p_2, ..., p_5*p_6 then you could use either linear algebra (I > think) or some slightly more sophisticated commutative algebra (e.g., > a Groebner basis, but that might be more than you need for this > specific case). > > regards > john perry > > On Sep 8, 1:57 am, Cary Cherng wrote: > > > > > I am not familiar with algebraic geometry or its terminology and new > > to sage. > > > p_1,...p_n and q are elements of Z[x_1,...,x_n]. In my context I have > > some evidence that q can be written as something like q = p_1*p_2 > > + ... + p_5*p_6. In other words q is a degree 2 polynomial in the > > p_i's. Can Sage find out if q can be written in terms of the p_i's? -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] Creating large matrix hangs
I have a sage script that ultimately creates a python list called MMv of length 35354. Each element is a list of length 55. This is in effect a 35354 by 55 matrix. Print statements show that when I run my script with "load two.sage" it gets stuck at taking this list and creating a matrix. I am using the following to try to create the matrix. MM = matrix(ZZ, MMv) Is there a way I can debug or understand why the matrix creation isn't returning? -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] Casting from type rational functions to type polynomials
R. = PolynomialRing(QQ) Eventually I compute a polynomial p with something like p = p1 / q.determinant() Sage gives p with type fraction field. How do I cast p back to the polynomial ring so I can call degree() on it? -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] Re: Casting from type rational functions to type polynomials
That worked. On Oct 23, 7:41 pm, John H Palmieri wrote: > On Oct 23, 7:20 pm, Cary Cherng wrote: > > > R. = > > PolynomialRing(QQ) > > > Eventually I compute a polynomial p with something like > > > p = p1 / q.determinant() > > > Sage gives p with type fraction field. How do I cast p back to the > > polynomial ring so I can call degree() on it? > > Does R(p) give what you want? > > sage: R. = PolynomialRing(QQ) > sage: R.inject_variables() > Defining g17, g19 > sage: p = (g17^2 - g19^2)/(g17 + g19) > sage: type(p) > > sage: type(R(p)) > 'sage.rings.polynomial.multi_polynomial_libsingular.MPolynomial_libsingular '> > > -- > John -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
[sage-support] qepcad and connected set
Given a collection of multivariate inequalities (field of real numbers) I would like to know if the set defined is connected. Does Sage have a easy way through qepcad to answer such a question? Documentation shows that there is a function connected_subset https://doc.sagemath.org/html/en/reference/interfaces/sage/interfaces/qepcad.html#sage.interfaces.qepcad.qepcad_formula_factory.connected_subset But it mentions only taking a single variable "Given a variable and a formula, returns a new formula which is true iff the set of values for the variable at which the original formula was true is connected" -- 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 view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/20bd99af-9492-4fb7-9e3d-883e2f9d05f3n%40googlegroups.com.
[sage-support] solve_ineq() fails
I tried using solve_ineq in the notebook in the simple way below and got an
error. It seems to be related to
http://trac.sagemath.org/sage_trac/ticket/11520
Is there a workaround?
R. = PolynomialRing(QQ)
solve_ineq([g1 > g2],[g1,g2])
Traceback (most recent call last):
File "", line 1, in
File "_sage_input_106.py", line 10, in
exec compile(u'open("___code___.py","w").write("# -*- coding: utf-8 -*-\\n"
+
_support_.preparse_worksheet_cell(base64.b64decode("c29sdmVfaW5lcShbZzEgPiBnMl0sW2cxLGcyXSk="),globals())+"\\n");
execfile(os.path.abspath("___code___.py"))
File "", line 1, in
File "/tmp/tmpwFoZvN/___code___.py", line 2, in
exec compile(u'solve_ineq([g1 > g2],[g1,g2])
File "", line 1, in
File
"/usr/lib/sagemath/local/lib/python2.7/site-packages/sage/symbolic/relation.py",
line 1204, in solve_ineq
return(solve_ineq_fourier(ineq, vars))
File
"/usr/lib/sagemath/local/lib/python2.7/site-packages/sage/symbolic/relation.py",
line 1115, in solve_ineq_fourier
ineq0 = [i._maxima_() for i in ineq]
AttributeError: 'bool' object has no attribute '_maxima_'
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To post to this group, send email to sage-support@googlegroups.com.
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-support?hl=en.
[sage-support] Re: solve_ineq() fails
The patch in the ticket seemed to only address making the error messages
better. Is there some mechanism to convert p1 and p2 to symbolic based
polynomials in the below code
R. = PolynomialRing(QQ)
...
# long sequence of calculations to compute polynomials p1 and p2
...
solve_ineq([p1 > 0, p2 > 0],[g1,g2])
On Monday, December 3, 2012 12:49:19 AM UTC-8, P Purkayastha wrote:
>
> On 12/03/2012 09:44 AM, Cary Cherng wrote:
> > I tried using solve_ineq in the notebook in the simple way below and got
> > an error. It seems to be related to
> > http://trac.sagemath.org/sage_trac/ticket/11520
> > Is there a workaround?
> >
> > R. = PolynomialRing(QQ)
> > solve_ineq([g1 > g2],[g1,g2])
> >
> > Traceback (most recent call last):
> >File "", line 1, in
> >File "_sage_input_106.py", line 10, in
> > exec compile(u'open("___code___.py","w").write("# -*- coding: utf-8
> -*-\\n" +
> _support_.preparse_worksheet_cell(base64.b64decode("c29sdmVfaW5lcShbZzEgPiBnMl0sW2cxLGcyXSk="),globals())+"\\n");
>
> execfile(os.path.abspath("___code___.py"))
> >File "", line 1, in
> >
> >File "/tmp/tmpwFoZvN/___code___.py", line 2, in
> > exec compile(u'solve_ineq([g1 > g2],[g1,g2])
> >File "", line 1, in
> >
> >File
> "/usr/lib/sagemath/local/lib/python2.7/site-packages/sage/symbolic/relation.py",
>
> line 1204, in solve_ineq
> > return(solve_ineq_fourier(ineq, vars))
> >File
> "/usr/lib/sagemath/local/lib/python2.7/site-packages/sage/symbolic/relation.py",
>
> line 1115, in solve_ineq_fourier
> > ineq0 = [i._maxima_() for i in ineq]
> > AttributeError: 'bool' object has no attribute '_maxima_'
>
> I think it is more related to this ticket:
> http://trac.sagemath.org/sage_trac/ticket/13645
>
> As soon as you write g1 > g2, the expression is evaluated and you get a
> boolean as a result. solve() or solve_ineq() clearly can't solve a
> boolean. This inequality is not evaluated if you have normal symbolic
> variables (declared using var()).
>
> #11520 will be solved by the patch in #13645.
>
>
>
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To post to this group, send email to sage-support@googlegroups.com.
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-support?hl=en.
[sage-support] solve_ineq does not always return the empty set as [ ]
In the below why does solve_ineq called with the inequalities t1 <= t2 , t1
> t2 not return [ ], but the other invocations of solve_ineq return the
empty set as [ ] ?
sage: g1,g2 = var('g1,g2')
sage: t1 = g1^2*g2^2
sage: t2 = g1^2*g2
sage: solve_ineq([t1 <= t2 , t1 > t2],[g1,g2])
[[g1 == 0, 1 < g2, 0 != 0], [g1 == 0, g2 < 0, 0 != 0]]
sage: solve_ineq([t1 < t2 , t1 > t2],[g1,g2])
[]
sage: s1 = g2^2
sage: s2 = g2
sage: solve_ineq([s1 <= s2 , s1 > s2],[g1,g2])
[]
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To post to this group, send email to sage-support@googlegroups.com.
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-support?hl=en.
[sage-support] Re: solve_ineq does not always return the empty set as [ ]
I recognize that it is the empty set described in a different way. Is there
a reason why it can't always describe the empty set as [ ] ?
The question I am having is how do I tell if it is the empty set for more
complicated inputs? For example, consider setting t1 and t2 to large
polynomials computed somehow. Then the following can give an output that is
quite large and it is impossible to tell if it is the empty set. Here we
know it should be the empty set because of the trivial inequalities given
as inputs. But what if the inputs are something meaningful and realistic?
sage: g1,g2 = var('g1,g2')
sage: t1 = large polynomial
sage: t2 = large polynomial
sage: solve_ineq([t1 <= t2 , t1 > t2],[g1,g2])
# output that is large and impossible to tell visually that it is the empty
set
On Monday, December 3, 2012 9:05:57 PM UTC-8, P Purkayastha wrote:
>
> On 12/04/2012 08:51 AM, Cary Cherng wrote:
> > In the below why does solve_ineq called with the inequalities t1 <= t2 ,
> > t1 > t2 not return [ ], but the other invocations of solve_ineq return
> > the empty set as [ ] ?
> >
> > sage: g1,g2 = var('g1,g2')
> > sage: t1 = g1^2*g2^2
> > sage: t2 = g1^2*g2
> > sage: solve_ineq([t1 <= t2 , t1 > t2],[g1,g2])
> > [[g1 == 0, 1 < g2, 0 != 0], [g1 == 0, g2 < 0, 0 != 0]]
> > sage: solve_ineq([t1 < t2 , t1 > t2],[g1,g2])
> > []
> >
> > sage: s1 = g2^2
> > sage: s2 = g2
> > sage: solve_ineq([s1 <= s2 , s1 > s2],[g1,g2])
> > []
> >
>
> You have to consider what is in the output. Both the answers contain "0
> != 0", so essentially none of the answers are feasible since "0 != 0" is
> always false.
>
>
>
>
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To post to this group, send email to sage-support@googlegroups.com.
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-support?hl=en.
[sage-support] Error installing package qepcad-1.5.0
I tried installing qepcad with sudo sage -i qepcad Linking failed with an error about the following file missing /usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/lib/saclibo.a The tail end of the error output log: Linking the optimized program.. g++ -O4 -I/usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/include -I. saclib/GCSI.c \ qepcad.a /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/sfext/sfexto.a /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/lift2D/lift2Do.a /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/newadj/newadjo.a /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/adj2d/adj2do.a /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/rend/rendo.a /usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/lib/saclibo.a -lreadline -lncurses qepcad.a /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/sfext/sfexto.a /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/lift2D/lift2Do.a /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/newadj/newadjo.a /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/adj2d/adj2do.a /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/rend/rendo.a /usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/lib/saclibo.a -lreadline -lncurses -o qepcad g++: error: /usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/lib/saclibo.a: No such file or directory g++: error: /usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/lib/saclibo.a: No such file or directory make[1]: *** [opt] Error 1 rm main/ENDQEPCAD.o proj/SEPLAB.o ticad/SIGNPR.o userint/PRDC.o main/INITDB.o sysolve/PRINTCOEFFSYSTEM.o ticad/ISPRIMIT.o io/QFFLPWR.o io/SAMPLEWR.o ticad/ISFECLI.o db/MODCRDB.o ticad/IPFSBM.o util/VALIDLBL.o ticad/ISDESIRED.o io/IPLLDWRMOD.o userint/PRDSTACK.o io/AFLWR.o ticad/CONVERT.o userint/PRHELP.o io/DNFLPWR.o userint/PRIPFZT.o ticad/LVCOMP.o userint/PRDEQNCONST.o io/DISCONWR.o ticad/DMAFUPNR.o proj/APPENDEC.o util/CELLDIM.o ticad/PROPAGATE.o io/XREADR.o sysolve/SYSTOUNNORMFORMULA.o ticad/CVCOMP.o sysolve/LPSILB.o userint/PRIGS.o sysolve/IPRSOL.o io/RLOPRDR.o io/GREADR.o db/DBSTATWR.o ticad/PLPOS.o userint/PROMPT.o ticad/QFFTEV.o normqff/ISATOMF.o ticad/CSSP.o proj/PROJMCECmod.o main/QEPCADauto.o util/SVPROD.o saclib/IPRNEVAL.o io/IPLLDWR.o userint/CELLFIDX.o userint/PRDPC.o ticad/MAFHOM.o userint/HELPFRD.o userint/PRPROJOP.o ticad/SSCOMP.o sysolve/LOSETSBF.o ticad/LPFTOLRLP.o main/SETUPSYS.o userint/PRDPCS.o main/FAIL.o userint/PRDSEARCH.o normqff/EXPAFLT.o io/CELLWR.o ticad/CHCELL.o io/LABELWR.o userint/PRQUIT.o userint/PRDCC.o userint/GETCID.o io/CREAD.o io/PLABELWR.o userint/PRCHPIVOT.o main/INITIO.o io/FREADR.o io/FILINE.o util/CELLDEG.o main/INITCTRL.o ticad/NZFOPQ.o ticad/PFPRDQ.o main/INITSTAT.o proj/IPDSCRQE.o userint/PRRMPJ.o proj/IPLFAC.o ticad/FNDTS.o ticad/RCFAFC.o proj/PROJCO.o userint/PRDDESIRED.o io/PRODWR.o ticad/TICADauto.o main/PRINTBANNER.o io/CONWR.o ticad/STACKMULT.o main/QEPCAD.o ticad/EC.o userint/PRDNQFF.o io/QFWR.o userint/PRDTRACED.o userint/PREQNCONSTL.o ticad/DSCOMP.o ticad/ECLI.o userint/PRUDB.o util/MBPROD.o userint/PRDIP.o ticad/PPPRDQ.o userint/PRDESIRED.o normqff/RMNOTOPN.o io/DSTATWR.o ticad/CHOOSE.o ticad/SETTRUTHVALUE.o userint/PRDLPI.o io/RLOPWR.o userint/PRGO.o userint/PRDLV.o normqff/NORMAF.o io/AFPDWR.o ticad/MAFUPGCD.o ticad/MAFINV.o io/QFFWR.o io/DESIREDRDR.o io/AFUPRWR.o main/qepcadcls.o userint/GFPCSTAT.o saclib/GCSI.o io/PCADWR.o normqff/EXPAFEQ.o normqff/NORMAFS.o userint/PRCCS.o ticad/CHSCN.o db/AFUPGCDB.o io/DNFWR.o ticad/NZFOPQR.o userint/HELPWR.o ticad/SIMPLEQE.o proj/IPDSCRPRS.o main/CADautoConst.o ticad/IPALLPARTIALS.o io/IUPRWR.o userint/USERINT.o io/VWRITE.o proj/PROJ.o ticad/ECR.o ticad/MAFUPEPROD.o proj/LUNION.o ticad/MAFUPNR.o proj/ECLEVEL.o ticad/MAFUPDIF.o userint/PRDQFF.o io/SIGNLWR.o db/AFUPSFNDB.o saclib/IPFZT.o io/BKSP.o saclib/SUBSET.o userint/PRCCSF.o io/CELLRDR.o saclib/SOSRSUPS.o userint/PRDPF.o normqff/EXPAFGT.o userint/RMMPF.o normqff/RMCAFS.o proj/PROJMCmod.o userint/PRTRACED.o userint/PRDCS.o userint/PRAPPROX.o proj/PROJMCEC.o db/IPFACDB.o ticad/IXCOMP.o userint/PRFINISH.o userint/PRDLFI.o ticad/MKMUL.o util/MMFLR.o io/LGOPWR.o ticad/TICAD.o proj/PROJLA.o userint/INTERACT.o normqff/EXPAFLTS.o ticad/AFUPLM.o proj/LCM.o sysolve/FINDRATCOORD.o io/QFRDR.o normqff/TYPEQFF.o ticad/EC1.o ticad/NORMAL.o proj/PROJECT.o userint/PRUSEDESIRED.o userint/PRSEARCH.o userint/ESPORD.o normqff/RMCAON.o io/ATOMFWR.o ticad/MAFUPMON.o ticad/TCHILD.o io/IPLDWR.o normqff/NORMQFF.o io/FWRITE.o db/SINGULAR.o sysolve/SIMPLIFYSYSLIST.o io/PCADSWR.o db/SUBSTDB.o io/PARENTWR.o io/SIGNWR.o util/RNFAF.o ticad/IPLSRP.o userint/PRMCC.o ticad/DELINPOL.o proj/IPRESQE.o io/CATTRNRDR.o sysolve/SIMPLIFYSYS.o ticad/CELLNA.o sysolve/COEFFSYS.o userint/PRRSP.o ticad/INITPCAD.o userint/PREQNCONST.o io/COMMN
[sage-support] Re: Error installing package qepcad-1.5.0
Machine information: Linux ccherng 3.5.0-17-generic #28-Ubuntu SMP Tue Oct 9 19:32:08 UTC 2012 i686 athlon i686 GNU/Linux Upon taking a closer look at the logs I noticed that it complained about not being able to find mkproto, mkmake, mklib: ./spkg-install: 19: ./spkg-install: bin/mkproto: not found ./spkg-install: 20: ./spkg-install: bin/mkmake: not found ./spkg-install: 21: ./spkg-install: bin/mklib: not found This is rather strang since I can see mkproto, mkmake, mklib root@ccherng:/usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/bin# ls -l mkproto mkmake mklib -rwx-- 1 root root 2128 May 21 2008 mklib -rwx-- 1 root root 2935 May 21 2008 mkmake -rwx-- 1 root root 468 May 20 2008 mkproto A more comprehensive log output with mkproto, mkmake, mklib missing messages: Attempting to download package qepcad >>> Checking online list of optional packages. [.] >>> Checking online list of experimental packages. [.] >>> Found qepcad-1.50 >>> Downloading qepcad-1.50.spkg. [] qepcad-1.50 Extracting package /usr/lib/sagemath/spkg/optional/qepcad-1.50.spkg -rw-r--r-- 1 root root 1104028 Mar 7 02:02 /usr/lib/sagemath/spkg/optional/qepcad-1.50.spkg Finished extraction Host system: Linux ccherng 3.5.0-17-generic #28-Ubuntu SMP Tue Oct 9 19:32:08 UTC 2012 i686 athlon i686 GNU/Linux C compiler: gcc C compiler version: Using built-in specs. COLLECT_GCC=gcc COLLECT_LTO_WRAPPER=/usr/lib/sagemath/local/bin/../libexec/gcc/i686-pc-linux-gnu/4.6.3/lto-wrapper Target: i686-pc-linux-gnu Configured with: ../src/configure --prefix=/var/lib/buildbot/build/sage/arando-1/arando_binary/build/sage-5.7/local --with-local-prefix=/var/lib/buildbot/build/sage/arando-1/arando_binary/build/sage-5.7/local --with-gmp=/var/lib/buildbot/build/sage/arando-1/arando_binary/build/sage-5.7/local --with-mpfr=/var/lib/buildbot/build/sage/arando-1/arando_binary/build/sage-5.7/local --with-mpc=/var/lib/buildbot/build/sage/arando-1/arando_binary/build/sage-5.7/local --with-system-zlib --disable-multilib Thread model: posix gcc version 4.6.3 (GCC) Building SACLIB 2.2... Installing linuxX86 system dependent files ... ./spkg-install: 19: ./spkg-install: bin/mkproto: not found ./spkg-install: 20: ./spkg-install: bin/mkmake: not found ./spkg-install: 21: ./spkg-install: bin/mklib: not found Building QEPCADB... On Thursday, March 7, 2013 10:53:12 AM UTC-8, kcrisman wrote: > > > > On Thursday, March 7, 2013 5:25:54 AM UTC-5, Cary Cherng wrote: >> >> I tried installing qepcad with >> sudo sage -i qepcad >> >> > I assume you are on some brand of Linux - more processor, etc., info would > be helpful. On my Mac it fails with a completely different error, in > trying to build saclib. (Because `uname` is given the `-i` flag which is > invalid on Mac.) In fact, it keeps compiling and then fails with a > different error about "sysdep.h"; in principle, we should quit with a > nonzero exit code if saclib fails, which is probably what the problem is > for you - check if it correctly compiled saclib. > > But note that qepcad is an "experimental" spkg - > http://sagemath.org/packages/experimental/, so it's not as "supported" as > the optional packages. In fact, the last update is 2008... and > http://trac.sagemath.org/sage_trac/ticket/11933 confirms that this is not > going to compile on many systems. > > There was a ticket http://trac.sagemath.org/sage_trac/ticket/10224 for > upgrading, but it hasn't seen activity in a while. > > > >> Linking failed with an error about the following file missing >> /usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/lib/saclibo.a >> >> The tail end of the error output log: >> >> >> >> Linking the optimized program.. >> g++ -O4 >> -I/usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/include -I. >> saclib/GCSI.c \ >> qepcad.a >> /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/sfext/sfexto.a >> >> /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/lift2D/lift2Do.a >> >> /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/newadj/newadjo.a >> >> /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/adj2d/adj2do.a >> >> /usr/lib/sagemath/spkg/build/qepcad-1.50/src/qesource/extensions/rend/rendo.a >> >> /usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/lib/saclibo.a >> -lreadline -lncurses qepcad.a >&
[sage-support] Re: Error installing package qepcad-1.5.0
mkproto mkmake and mklib are tsch scripts. sudo apt-get install tsch solved the problem. On Thursday, March 7, 2013 5:06:02 PM UTC-8, Cary Cherng wrote: > > Machine information: > Linux ccherng 3.5.0-17-generic #28-Ubuntu SMP Tue Oct 9 19:32:08 UTC 2012 > i686 athlon i686 GNU/Linux > > Upon taking a closer look at the logs I noticed that it complained about > not being able to find mkproto, mkmake, mklib: > ./spkg-install: 19: ./spkg-install: bin/mkproto: not found > ./spkg-install: 20: ./spkg-install: bin/mkmake: not found > ./spkg-install: 21: ./spkg-install: bin/mklib: not found > > This is rather strang since I can see mkproto, mkmake, mklib > root@ccherng:/usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/bin# > ls -l mkproto mkmake mklib > -rwx-- 1 root root 2128 May 21 2008 mklib > -rwx-- 1 root root 2935 May 21 2008 mkmake > -rwx-- 1 root root 468 May 20 2008 mkproto > > > A more comprehensive log output with mkproto, mkmake, mklib missing > messages: > > Attempting to download package qepcad > >>> Checking online list of optional packages. > [.] > >>> Checking online list of experimental packages. > [.] > >>> Found qepcad-1.50 > >>> Downloading qepcad-1.50.spkg. > [] > qepcad-1.50 > > Extracting package /usr/lib/sagemath/spkg/optional/qepcad-1.50.spkg > -rw-r--r-- 1 root root 1104028 Mar 7 02:02 > /usr/lib/sagemath/spkg/optional/qepcad-1.50.spkg > Finished extraction > > Host system: > Linux ccherng 3.5.0-17-generic #28-Ubuntu SMP Tue Oct 9 19:32:08 UTC 2012 > i686 athlon i686 GNU/Linux > > C compiler: gcc > C compiler version: > Using built-in specs. > COLLECT_GCC=gcc > > COLLECT_LTO_WRAPPER=/usr/lib/sagemath/local/bin/../libexec/gcc/i686-pc-linux-gnu/4.6.3/lto-wrapper > Target: i686-pc-linux-gnu > Configured with: ../src/configure > --prefix=/var/lib/buildbot/build/sage/arando-1/arando_binary/build/sage-5.7/local > > --with-local-prefix=/var/lib/buildbot/build/sage/arando-1/arando_binary/build/sage-5.7/local > > --with-gmp=/var/lib/buildbot/build/sage/arando-1/arando_binary/build/sage-5.7/local > > --with-mpfr=/var/lib/buildbot/build/sage/arando-1/arando_binary/build/sage-5.7/local > > --with-mpc=/var/lib/buildbot/build/sage/arando-1/arando_binary/build/sage-5.7/local > > --with-system-zlib --disable-multilib > Thread model: posix > gcc version 4.6.3 (GCC) > > Building SACLIB 2.2... > Installing linuxX86 system dependent files ... > ./spkg-install: 19: ./spkg-install: bin/mkproto: not found > ./spkg-install: 20: ./spkg-install: bin/mkmake: not found > ./spkg-install: 21: ./spkg-install: bin/mklib: not found > Building QEPCADB... > > On Thursday, March 7, 2013 10:53:12 AM UTC-8, kcrisman wrote: >> >> >> >> On Thursday, March 7, 2013 5:25:54 AM UTC-5, Cary Cherng wrote: >>> >>> I tried installing qepcad with >>> sudo sage -i qepcad >>> >>> >> I assume you are on some brand of Linux - more processor, etc., info >> would be helpful. On my Mac it fails with a completely different error, in >> trying to build saclib. (Because `uname` is given the `-i` flag which is >> invalid on Mac.) In fact, it keeps compiling and then fails with a >> different error about "sysdep.h"; in principle, we should quit with a >> nonzero exit code if saclib fails, which is probably what the problem is >> for you - check if it correctly compiled saclib. >> >> But note that qepcad is an "experimental" spkg - >> http://sagemath.org/packages/experimental/, so it's not as "supported" >> as the optional packages. In fact, the last update is 2008... and >> http://trac.sagemath.org/sage_trac/ticket/11933 confirms that this is >> not going to compile on many systems. >> >> There was a ticket http://trac.sagemath.org/sage_trac/ticket/10224 for >> upgrading, but it hasn't seen activity in a while. >> >> >> >>> Linking failed with an error about the following file missing >>> /usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/lib/saclibo.a >>> >>> The tail end of the error output log: >>> >>> >>> >>> Linking the optimized program.. >>> g++ -O4 >>> -I/usr/lib/sagemath/spkg/build/qepcad-1.50/src/saclib2.2.0/include -I. >>> saclib/GCSI
