nevermind I solved my problem.
On Sep 7, 5:49 pm, Cary Cherng cche...@gmail.com 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
It seems as if the the Graphics3d Object's face_list() returns a list
of 3-tuples or 4-tuples depending upon which plot3d method you call:
implicit_plot3d - returns an array of 3-tuples
[[(1.8974358974358974, -0.5641025641025641, -0.28205128205128216),
(1.9014844804318489, -0.5641025641025641,
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
On Sep 8, 2:49 am, Cary Cherng cche...@gmail.com 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.
Blind checking if a
On 8 sep, 02:52, kcrisman kcris...@gmail.com wrote:
On Sep 7, 5:26 pm, Burcin Erocal bur...@erocal.org wrote:
Hi,
Here is a short example to replicate the first error mentioned below:
b = [var('b_%s'%i) for i in range(4)]
precomp = (2^b_2 + 2)*(2^b_1 + 2^(-b_1) + 2^b_1*2^b_0 -
Hi,
What I want to do is to express some expression in function of some
vectors and matrix. Exactly what I'am trying is to express third
iteration of CG algorithm in function of first iteration so that third
iteration rely only on the variables(vectors and scalars) from the
first iteration (back
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
On 9/8/10 7:45 AM, BSC-BCN wrote:
I hope you can understand
me...
I don't think I really do, but this thread might contain some useful
things for you:
http://groups.google.com/group/sage-devel/browse_thread/thread/cafb486c79a2eb3c/d0bb78d09a4fb52a
Thanks,
Jason
--
To post to this
is there a good way of testing if a polynomial f(x,y) is irreducible
or not as there is a lack of a is_irreducible command
also is there a way for sage not to print the line
? not implemented
after checking randomly generated f fits various criterion
--
To post to this group, send email to
is there a good way of testing if a polynomial f(x,y) is irreducible
or not as there is a lack of a is_irreducible command
also is there a way for sage not to print the line
? not implemented
after checking randomly generated f fits various criterion
--
To post to this group, send email to
Dear all,
I am trying to implement a recursive algorithm that is rather complex,
in the sense that it uses a high number of variables and (elementary)
computations. The output in Sage looks fine but it gets quite slow, so
I am thinking of ways to speed it up. Given that it is mainly a lot of
Hi again,
I'm following up to see if someone has any ideas/suggestions for how
to create a GUI in the notebook and interact with it in a bi-
directional way, where Python code (with the help of Javascript?) can
not only read the GUI controls, but also impact/write them.
Any example/pointer
I just installed the latest version of gcc, but there are still the
same errors. Anyway, does it make any difference for the binary
version?
On 8 Sep., 02:19, Innigo enrico.manto...@gmail.com wrote:
Is it possilbe it's just because the sage install tree may have
moved? There seems to be a fair
On 15 aug, 12:50, jockothy jgmcc...@gmail.com wrote:
Hi!
There is a (huge) difference between win version 4.5.1 and 4.5.2.
In version 4.5.1 an externalnetworkwas setup, so I can use Sage via
Windows Firefox using the address 192.168.236.128.
The 4.5.2 version gives the warning that
On 9/8/10 1:46 PM, Simon King wrote:
Hi Kees!
On 8 Sep., 18:19, KvSkeesvansch...@gmail.com wrote:
...
I am thinking of ways to speed it up. Given that it is mainly a lot of
looping and a lot of elementary computations, I would guess
translating it to Cython could help a lot.
However I am
Hi Jason!
On 8 Sep., 20:57, Jason Grout jason-s...@creativetrax.com wrote:
Actually, for a while now, for i in range(...) is translated into fast
C intelligently. In fact, I believe it's the recommended syntax now,
instead of 0=i...
Even if you do *not* cdefine cdef int i? That's new to me.
On 9/8/10 2:15 PM, Simon King wrote:
Hi Jason!
On 8 Sep., 20:57, Jason Groutjason-s...@creativetrax.com wrote:
Actually, for a while now, for i in range(...) is translated into fast
C intelligently. In fact, I believe it's the recommended syntax now,
instead of 0=i...
Even if you do *not*
On 9/8/10 2:22 PM, Jason Grout wrote:
On 9/8/10 2:15 PM, Simon King wrote:
Hi Jason!
On 8 Sep., 20:57, Jason Groutjason-s...@creativetrax.com wrote:
Actually, for a while now, for i in range(...) is translated into fast
C intelligently. In fact, I believe it's the recommended syntax now,
Thanks a lot for the hints so far, I will go and try them out. I'd
still also be very interested if somebody could shed some more light
on my original questions!
Thanks, Kees
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
It sounds like a C program using MPFR (http://www.mpfr.org)
would do what you want. As MPFR is built into SAGE, you might
perhaps find it more convenient to invoke MPFR within SAGE.
Sincerely,
Greg Marks
| Greg Marks
supose i have an input list (which is a list of unknown size) and
where each term is a polynomial of form f(x,y)
i want to define a function moniclist(list)
such that the output makes each term of list monic wrt x
eg
if list=[2*x, x^2*y^2+x+1, 4*x^2+y^2+3]
output would be[x, x^2+x+1, x^2+y^2+3]
supose i have an input list (which is a list of unknown size) and
where each term is a polynomial of form f(x,y)
i want to define a function moniclist(list)
such that the output makes each term of list monic wrt x
eg
if list=[2*x, x^2*y^2+x+1, 4*x^2+y^2+3]
output would be[x, x^2+x+1, x^2+y^2+3]
On Wed, Sep 8, 2010 at 3:03 PM, Greg Marks gtma...@gmail.com wrote:
It sounds like a C program using MPFR (http://www.mpfr.org)
would do what you want. As MPFR is built into SAGE, you might
perhaps find it more convenient to invoke MPFR within SAGE.
This is what I would recommend. You can do
On Sep 8, 3:52 pm, andrew ewart aewartma...@googlemail.com wrote:
supose i have an input list (which is a list of unknown size) and
where each term is a polynomial of form f(x,y)
i want to define a function moniclist(list)
such that the output makes each term of list monic wrt x
eg
if
Thanks all, however I am not very successful so far :(.
I tried both options mentioned before:
- only optimize the loops in Cython and keep using symbolic
expressions/infinite precision, but this is unfortunately rather
slow;
- fully optimize in Cython by turning to doubles everywhere, although
On 9/8/10 8:39 PM, KvS wrote:
Thanks all, however I am not very successful so far :(.
I tried both options mentioned before:
- only optimize the loops in Cython and keep using symbolic
expressions/infinite precision, but this is unfortunately rather
slow;
- fully optimize in Cython by turning
Thanks, this is exactly what I want. I do want to be modular. However,
my graphics object
contains 0 graphics primitives
g = Graphics()
def f1(g)
g += polygon(...)
def f2(g)
g += ...
show(g)
Can I not pass g as a parameter and have it returned to outer scope?
--
To post to this group,
On 9/8/10 9:40 PM, Innigo wrote:
Thanks, this is exactly what I want. I do want to be modular. However,
my graphics object
contains 0 graphics primitives
g = Graphics()
def f1(g)
g += polygon(...)
def f2(g)
g += ...
show(g)
Can I not pass g as a parameter and have it returned to
The simplest way to do it would be to either download sagenb, or take
it from $SAGE_ROOT/spkg/standard/sagenb-xx.spkg, untar it, apply the
patch, and do:
`sage -python setup.py develop`
which will automatically propagate any changes made to the sagenb
directory. Packaging information is included
29 matches
Mail list logo
