Alan
Posting a reply to repay all the help Ive received from the Sage
folk.
Im a software guy more than a math guy and no Sage expert but
hopefully this is accurate.
> 1. Why do the following equations give different answers?
> sage:solve([exp(x)==exp(0)],x)
> [x == 0]
> sage:solve([exp(x)==exp(-
On Nov 16, 12:54 pm, François Bissey wrote:
> > Thought you might like to know that sage-4.6.1.alpha1 built with no
> > probs but
> > alpha2 failed to build on Ubuntu 10.10 (linux 2.6.35-23-generic)
> > (PC = 2GB Ram, Intel Pentium 4 CPU 3.2GHz)
>
> > Error was...
> > make[2]: *** [all] Error 2
>
Thought you might like to know that sage-4.6.1.alpha1 built with no
probs but
alpha2 failed to build on Ubuntu 10.10 (linux 2.6.35-23-generic)
(PC = 2GB Ram, Intel Pentium 4 CPU 3.2GHz)
Error was...
make[2]: *** [all] Error 2
make[2]: Leaving directory `/home/kyprir/sage-4.6.1.alpha2/spkg/build/
e
A checklist is forming...
1) speed (that probably means C or Cython)
2) correctness (demonstrate correct randomness according to the distribution
AND on differerent platforms)
3) documentation (references, etc)
(any other ideas, feel free to add to this thread ;-)
On Sun, Sep 5, 2010 at 5:08 PM
Thanks for the advice William - will take everything on board
On Sun, Sep 5, 2010 at 1:58 PM, William Stein wrote:
> On Sat, Sep 4, 2010 at 7:27 PM, Ross Kyprianou wrote:
> > +10 Certainly agree that the module is relevant and my work should be
> > interwoven into it
> &g
+10 Certainly agree that the module is relevant and my work should be
interwoven into it
It was very timely that you drew my attention to this.
I think I should draw up an initial design for the functionality Im
aiming for and possibly put it in a new thread for comment.
Im happy to do the most of
ry'ed" whenever myfunction(X) is called (much like
exp(X) invokes X.exp() in functional.py)
(can lambda functions or __call__ help here?)
Anyone have any ideas what mechanism might do that?
On Sat, Sep 4, 2010 at 1:37 PM, Jason Grout wrote:
> On 9/3/10 10:53 PM, Ross Kyprianou wrote:
Ive defined a class and need to pass instances of it to any standard
real function in Sage such as exp and log (i.e. functions that accept
numbers (ints, reals etc) and symbolic vars but obviously they wont
accept this new class thats been created). I cant modify the functions
to accept this new ty
It seems harmless as a short term strategy to use the 130 modules that
have been identified to get Sage to 90% coverage.
Once that is met, I imagine the next goal would be 95% then 100% coverage.
And from what Ive seen of the Sage developer community there would
then be a revisiting and addition of
I couldnt see a solution to this in this thread so heres a related question
The following produces the exact output Id like to produce (to assign to the
_repr_ property of a class)
%latex
N(\mu,\sigma^2)
How can I set things up to do this in a (_repr_) function (as a sage
statement/function cal
up, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
# HG changeset patch
# User Ross Kyprianou
# Date 1273148141 -34200
# Node ID ffad4517cf8c8fc0f5d5b724652672cf
Burcin
> Your example is a good test case, so please
> keep on trying, sending emails, and poking people (me) to work on this.
> Can you post some example code (your integrator function) so I have
> something to experiment with?
Id like to do as much as possible. This might be a good example for
> You should add a new integrator function and register it in the
> dictionary sage.symbolic.integration.integral.available_integrators.
>
> At some point we also need to come up with a protocol to allow these
> functions to transform the input and pass it on to be processed by the
> next one in th
This turned out as good as it looked Nicolas
A lot of the planned functionality is already in place with this
initial code - Thanks!
Now it should be possible (for me) to implement some more code (which
is indicated in the second section
(below) i.e. under the section with title "I need to impleme
> (You may ask someone else to build a binary for your machine.
> Otherwise you could report how long the build took on your system,
> though this depends on the amount of RAM and disk speed as well. Last
> time I've built 4.3.5 on a Pentium 4 *Prescott*/Socket 478/3,2 GHz,
> with 4GB DDR1-400 CL2,
> You can try (or might want) to build on a newer (and faster) x86
> machine with SAGE_FAT_BINARY=YES (see README.txt).
Oh to have the option!
(I just have this PC for the moment ;-)
> (The binary you downloaded seems to not have been built with this
> switch, or something really goes wrong on 10
physical, 32 bits virtual
power management:
On Sat, May 1, 2010 at 11:08 PM, Nathan O'Treally wrote:
> On 1 Mai, 14:13, Ross Kyprianou wrote:
>> I just upgraded to Ubuntu 10.4
>> I downloaded the Sage 32 bit Ubuntu 9.10 version to see how it will go
>
> What processor are
I just upgraded to Ubuntu 10.4
I downloaded the Sage 32 bit Ubuntu 9.10 version to see how it will go
and got the error at the end of the email
Am I right in thinking I should just try making Sage from source?
~/sage-4.4$ ./sage
-
Nicolas
No worries about deadlines - this looks excellent - thanks!
Will let you know how things go. This gives me lots to work with
Thanks again!
On May 1, 6:30 pm, "Nicolas M. Thiery"
wrote:
> Dear Ross,
>
> On Mon, Apr 19, 2010 at 06:38:31PM +0930, ross kypri
Excellent Burcin - thanks!
Ill try your ideas below.
Ross
On Sat, Apr 24, 2010 at 7:42 PM, Burcin Erocal wrote:
> On Thu, 22 Apr 2010 20:52:53 -0700 (PDT)
> Ross Kyprianou wrote:
>
>> Addendum: I suppose a general query would be how do we incorporate new
>> knowledge into
matter of identifying the area (e.g. pynac, pari, maxima) and
proposing a change to that codebase (possibly in C or Lisp)?
On Apr 23, 11:27 am, Ross Kyprianou wrote:
> Question 1:
> Is it possible (and reasonable) to have the error function, erf,
> return 0 for "erf(0)"?
> Cu
Question 1:
Is it possible (and reasonable) to have the error function, erf,
return 0 for "erf(0)"?
Currently it returns the expression: erf(0)
Question 2 (related):
The standard normal (or Gaussian) curve has half its (unit) area to
the left (and right) of x==0 as we see here...
sage: gaussian =
> Send me your code, and I
> refactor it to its simplest form, as a basis for further work.
Very kind offer :-)
> The most efficient would be to upload it on the Sage-Combinat queue,
> but that will take some learning the tool:
> http://wiki.sagemath.org/combinat/MercurialStepByStep; otherwise
>
>> Any ideas of why _repr_ might not be working inside the class?
> Was this class that of the category or the parent?
I made a copy of AlgebrasWithBasis.py (so that's the category isnt it?)
and placed my version of _repr_ is various places within that code but
it didnt override the default _repr
On Tue, Apr 13, 2010 at 2:53 AM, Nicolas M. Thiery
wrote:
>> ### Example 1 ###
>> sage: (P,Q,R)=
>> MtxAlgebrasWithBasis(QQ).example(('P','Q','R')).algebra_generators()
>
> Do you need a specific category for your application? In particular,
> will you have several parents between which to share
# This made things very interesting.
# Using WordOptions(identifier='') does most of the work needed
### Example 1 ###
sage: (P,Q,R)=
MtxAlgebrasWithBasis(QQ).example(('P','Q','R')).algebra_generators()
sage: P*(Q+R)
B[word: PQ] + B[word: PR]
### Example 2 ###
sage: WordOptions(identifier='')
s
ory of sets, Category of objects]
Im guessing the code to make the "B[word: ]" string
may have been in a python file that corresponded to one of the
Categories above but couldnt find it
Appreciate any help
thanks!
Ross
On Sat, Apr 10, 2010 at 6:12 AM, Nicolas M. Thiery
wrote:
>
Nicolas
C = AlgebrasWithBasis(QQ)
C?
certainly did report back more info!
And the categories seem to be the very classes needed for "abstract matrices"!
Its a bit time-consuming to get on top of this if one is new to
Categories (like me ;-) but the amount of functionality that you
inherit makes
Hi
Id like to write a package that can do "pure"/"abstract" matrix
expressions such as in the following examples
To keep things simple, in the examples below, let
A, B, C... be matrices; k be a scalar
"*" be matrix or scalar multiplication, "^-1" and "^T" and "^n" be
matrix inverse, transpose and
Its a good thing that we already make available binaries for those
people with less Linux experience
Whatever we can do to make Sage "work out of the box" is good
(i.e. I know its 99% there but it will be even better if we can avoid
asking people to ensure certain things are installed and are certa
f matlab is similar to the sys time of Sage (but
matlab returned in about 2 secs and sage returned in over 2 mins)
Apologies if I missed something again but one can always learn from
mistakes :)
On Feb 19, 1:33 am, Martin Albrecht
wrote:
> On Thursday 18 February 2010, Ross Kyprianou wrote
Harald
There seems to be definitely a problem
Just tried it on sage.math
sage: %time random_matrix(RDF, 1)
took over 2mins ()
tic; m = randn(100,100); toc
took 0.0003 secs!
On Feb 19, 12:05 am, Harald Schilly wrote:
> Hi, I did some benchmarks and during that i noticed that it takes
>
Apologies for asking Harold but how big was "s"?
On Feb 19, 12:05 am, Harald Schilly wrote:
> Hi, I did some benchmarks and during that i noticed that it takes
> quite long to create a random_matrix. Is there something obvious I'm
> missing or is there a better way to do this? Ticket?
>
> Benchma
33 matches
Mail list logo
