[sage-support] [ANN] ODE dy/dt = f(t) solver with guaranteed specifiable accuracy

2011-09-27 Thread dmitrey
hi all, now free solver interalg (http://openopt.org/interalg , based on interval analysis) can solve ODE dy/dt = f(t) with guaranteed specifiable accuracy. For more details see http://openopt.org/ODE , there is an example of comparison with scipy.integrate.odeint, where latter fails to solve a

[sage-support] Re: error: C preprocessor /lib/cpp fails sanity check (installing sage-4.7.1 from source)

2011-09-27 Thread jsymons
Another error: libImaging/Jpeg.h:11:21: fatal error: jpeglib.h: No such file or directory compilation terminated. error: command 'gcc' failed with exit status 1 Warning: Failed to install PIL with TK, retrying without TK support... Disabling Tkinter (Tcl/Tk) support in PIL build. running

[sage-support] Question about Patterson Algorithm Implementation

2011-09-27 Thread juaninf
Hi everybody, I am implement Patterson Algorithm for Goppa code, I am copying lines from paper How SAGE helps to implement Goppa Codes and McEliece PKCSs [attach], and my test is a random vector . the error are in Line 77, I expect get roots from \sigma (locator polynomial), but implementation

Re: [sage-support] Question about Patterson Algorithm Implementation

2011-09-27 Thread D. S. McNeil
I don't think you should need to call _add_, but this looks like a bug to me: -- | Sage Version 4.7.1, Release Date: 2011-08-11 | | Type notebook() for the GUI, and license() for information.|

[sage-support] How to simplify a sum of fractions?

2011-09-27 Thread Gary Church
Hello, I'm trying to simplify the list [pi/4..3*pi], which gives [(1/4)*pi, (1/4)*pi + 1, (1/4)*pi + 2, …] so that I get [pi/4, 5*pi/4, 9*pi/4, …]. Is there an easy way to do this? Thanks much, Gary -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from

[sage-support] Re: How to simplify a sum of fractions?

2011-09-27 Thread John H Palmieri
Those lists aren't the same. (1/4)*pi + 1 is equal to (pi+4)/4, not 5*pi/4. So I sure hope there's no way to simplify your first list into your second one. If I add in one more term at beginning so that Sage can tell what the difference is between consecutive terms, I get something perhaps

Re: [sage-support] Question about Patterson Algorithm Implementation

2011-09-27 Thread William Stein
On Tue, Sep 27, 2011 at 7:15 PM, D. S. McNeil dsm...@gmail.com wrote: I don't think you should need to call _add_, but this looks like a bug to me: -- | Sage Version 4.7.1, Release Date: 2011-08-11                       | |

[sage-support] reducing ideal wrt another ideal

2011-09-27 Thread Vinay Wagh
Suppose I have two ideals I J in k[X_1,\cdots,x_n], where k is a field. How do I reduce an ideal I wrt ideal J. e.g. Singular provides me a command singular reduce(I,std(J)); Without moving back and forth to Singular, is it possible to implement this in sage? I tried the following code: