Screenshot instructions:
Windows
Mac
Red Hat Linux
Ubuntu
Click URL instructions:
Rightclick on ad, choose "Copy Link", then paste here →
(This may not be possible with some types of ads)
You can subscribe to this list here.
2014 
_{Jan}

_{Feb}
(232) 
_{Mar}
(323) 
_{Apr}
(383) 
_{May}
(359) 
_{Jun}
(435) 
_{Jul}
(252) 
_{Aug}
(172) 
_{Sep}
(265) 
_{Oct}
(263) 
_{Nov}
(350) 
_{Dec}
(359) 

2015 
_{Jan}
(267) 
_{Feb}
(220) 
_{Mar}
(311) 
_{Apr}
(269) 
_{May}
(388) 
_{Jun}
(403) 
_{Jul}
(172) 
_{Aug}
(399) 
_{Sep}
(364) 
_{Oct}
(269) 
_{Nov}
(357) 
_{Dec}
(468) 
2016 
_{Jan}
(618) 
_{Feb}
(592) 
_{Mar}
(625) 
_{Apr}
(516) 
_{May}
(375) 
_{Jun}
(155) 
_{Jul}
(346) 
_{Aug}
(262) 
_{Sep}
(346) 
_{Oct}
(291) 
_{Nov}
(333) 
_{Dec}
(335) 
2017 
_{Jan}
(436) 
_{Feb}
(460) 
_{Mar}
(370) 
_{Apr}
(189) 
_{May}
(252) 
_{Jun}
(272) 
_{Jul}
(286) 
_{Aug}
(293) 
_{Sep}
(303) 
_{Oct}
(331) 
_{Nov}
(346) 
_{Dec}
(273) 
2018 
_{Jan}
(198) 
_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 







1
(7) 
2
(14) 
3
(22) 
4
(14) 
5
(9) 
6
(8) 
7
(18) 
8
(8) 
9
(1) 
10
(4) 
11
(4) 
12
(22) 
13
(10) 
14
(8) 
15
(6) 
16
(6) 
17
(15) 
18
(1) 
19
(13) 
20
(15) 
21
(7) 
22
(12) 
23
(17) 
24
(13) 
25
(10) 
26
(12) 
27
(8) 
28
(9) 
29
(14) 
30
(10) 
31
(6) 





From: Richard Fateman <fateman@be...>  20140317 20:02:44

and for a fun read, see http://gosper.org/newsrope.pdf 
From: Gunter Königsmann <gunter@pe...>  20140317 19:55:29

Since this was one of the first issues I encountered when trying to evaluate if maxima is fit for daily use and one of my colleagues encountered it, too  I am all for changing maxima's current behavior in this place. As far as I understand the current behavior doesn't seem to be useful enough to justify a configuration option. But as I'm only a user and neither a maths mage nor a lisp programmer  I don't think my opinion should cause this much in this aspect. Kind regards, Gunter. On 11.03.2014 16:31, Leo Butler wrote: >> On 20140308, Leo Butler <l_butler@...> wrote: >> >> > After reading the Macsyma reference manual, v. 15, p. 308, I see that >> > the *current* behaviour of subscripted functions is consistent with >> > Macsyma: >> > >> > (%i1) f[k](e) := coeff(e,x,k)$ >> > (%i2) f[2](3*x^21); >> > (%o2) 0 < predicted behaviour in Manual >> > >> > >> > (%i3) defsub(F,[k],[e],coeff(e,x,k)); >> > (%o5) F(k):=buildq([g17111:k],lambda([e],block([k:g17111],coeff(e,x,k)))) >> > (%i6) F(2)(3*x^21); >> > (%o6) 3 < desired behaviour >> > >> > On reflection, I do not want to propose that well established >> > behaviour be changed, but maybe it would be appropriate to add this >> > functionality? >> >> Well, having thought it through, I think that this new behavior is >> really the correct and most reasonable way to handle it; I think the >> behavior documented in the Macsyma manual is going to be an unpleasant >> surprise. I'm against adding this functionality as another function; >> it is very subtly different from the previous behavior, and there isn't >> any good reason for having both. > > Yes, the behaviour is an unpleasant surprise each time I, or a student > of mine, stumble on it. > > Since the Macsyma manual devotes a halfpage to the behaviour and how > to work around it in, I think this has been an issue for a while. > >> >> So at this point I'm in favor of replacing the existing behavior; >> I doubt that anyone is counting on the current, incorrect behavior in >> any case in which it differs from the new behavior, so I don't think >> there would be any pain of changing it. > > As a counterpoint, the behaviour is documented and has been a part of > Maxima/Macsyma for ~20 years at least. I don't know who would be > counting on the behaviour, though, as opposed to working around > it. But maybe that is my limited imagination. > >> >> It occurs to me that there is some satisfaction in constructing a >> "simpler" function given values for free parameters; in the sense that, >> for example, lambda([e], coeff(e, x, 2)) is simpler than >> lambda([e], block([k : 2], coeff(e, x, k))). Evaluating the inner block >> yields something simpler (when it doesn't cause an error), so would >> substituting into the inner block. But neither of those is exactly >> equivalent to the lambda(... block(... )) construct, which is correct. >> So I'll have to give up that satisfaction in order to get correctness. > > Agreed. > >  > I wonder if some others could chime in? > > Leo > >  > Learn Graph Databases  Download FREE O'Reilly Book > "Graph Databases" is the definitive new guide to graph databases and their > applications. Written by three acclaimed leaders in the field, > this first edition is now available. Download your free book today! > http://p.sf.net/sfu/13534_NeoTech > _______________________________________________ > Maximadiscuss mailing list > Maximadiscuss@... > https://lists.sourceforge.net/lists/listinfo/maximadiscuss > 
From: Alexander Popolitov <popolit@gm...>  20140317 16:53:26

Thanks a lot! On 03/17/2014 05:38 PM, Evgeniy Maevskiy wrote: > sublist > sublist_indices > > > 17.03.2014 19:24, Alexander Popolitov пишет: >> Hi everyone! >> >> Can you, please, point me to correct Maxima idiom to select elements of >> the list, satysfying certain criterion? >> The following variants: >> 1. grep (a la Perl) >> 2. filter (a la Python) >> 3. select (a la Mathematica) >> 4. removeifnot (a la Common Lisp) >> do not work, and my imagination is exhausted =). Of course, this could >> be done with going to lisplevel and doing removeifnot, >> but it is annoying to do that all the time... >> >> Yours sincerely, >> Alexandr Popolitov >> >>  >> Learn Graph Databases  Download FREE O'Reilly Book >> "Graph Databases" is the definitive new guide to graph databases and their >> applications. Written by three acclaimed leaders in the field, >> this first edition is now available. Download your free book today! >> http://p.sf.net/sfu/13534_NeoTech >> _______________________________________________ >> Maximadiscuss mailing list >> Maximadiscuss@... >> https://lists.sourceforge.net/lists/listinfo/maximadiscuss >> > >  > Learn Graph Databases  Download FREE O'Reilly Book > "Graph Databases" is the definitive new guide to graph databases and their > applications. Written by three acclaimed leaders in the field, > this first edition is now available. Download your free book today! > http://p.sf.net/sfu/13534_NeoTech > _______________________________________________ > Maximadiscuss mailing list > Maximadiscuss@... > https://lists.sourceforge.net/lists/listinfo/maximadiscuss 
From: Evgeniy Maevskiy <emaevskiy@e...>  20140317 16:29:53

sublist sublist_indices 17.03.2014 19:24, Alexander Popolitov пишет: > Hi everyone! > > Can you, please, point me to correct Maxima idiom to select elements of > the list, satysfying certain criterion? > The following variants: > 1. grep (a la Perl) > 2. filter (a la Python) > 3. select (a la Mathematica) > 4. removeifnot (a la Common Lisp) > do not work, and my imagination is exhausted =). Of course, this could > be done with going to lisplevel and doing removeifnot, > but it is annoying to do that all the time... > > Yours sincerely, > Alexandr Popolitov > >  > Learn Graph Databases  Download FREE O'Reilly Book > "Graph Databases" is the definitive new guide to graph databases and their > applications. Written by three acclaimed leaders in the field, > this first edition is now available. Download your free book today! > http://p.sf.net/sfu/13534_NeoTech > _______________________________________________ > Maximadiscuss mailing list > Maximadiscuss@... > https://lists.sourceforge.net/lists/listinfo/maximadiscuss > 
From: Alexander Popolitov <popolit@gm...>  20140317 15:51:54

Ok, KLUDGED via specifying (ql:quickload 'swank) in ~/.sbclrc, and then recompiling Maxima with these new settings. Now (swank:createserver :port xxx) works like charm.  Original Message  Subject: Re: [Maximadiscuss] maxima via quicklisp Date: Sun, 16 Mar 2014 13:21:22 +0000 From: Alexander Popolitov <popolit@...> To: maximadiscuss@... Ok, I tried starting SWANK, that's the output I got: (%i8) load("startswank"); To load "swank": Load 1 ASDF system: swank ; Loading "swank" .;; ;; Error while compiling /home/popolit/quicklisp/dists/quicklisp/software/slime20131211cvs/swanksbcl.lisp: ;; Don't know how to REQUIRE SBINTROSPECT. ;; See also: ;; The SBCL Manual, Variable SBEXT:*MODULEPROVIDERFUNCTIONS* ;; The SBCL Manual, Function REQUIRE ;; Aborting. ;; ; ; compilation unit aborted ; caught 4 fatal ERROR conditions loadfile: failed to load /home/popolit/.maxima/startswank.lisp  an error. Entering the Maxima debugger. Enter ':h' for help. ~/.maxima/startswank.lisp contains: (ql:quickload '#:swank) (swank:createserver :port 56789) It ERRORed immediately, when there was REQUIRE instead of QL:QUICKLOAD, and then I decided to substitute and see, what happens. However, it seems, that REQUIRE is just somehow disabled in Maxima... On 03/15/2014 05:52 PM, Raymond Toy wrote: >>>>>> "Alexander" == Alexander Popolitov <popolit@...> writes: > Alexander> Hello everyone, > Alexander> I'm very new to maxima, but have some experience with common lisp. > Alexander> So, I wonder, is it possible (and how hard it would be, approximately) > Alexander> to make maxima > Alexander> loadable directly via quicklisp, rather than downloading and compiling > Alexander> standalone executable? > > I believe there are several things preventing maxima from being in > quicklisp: > > 1. Maxima uses autoconf/automake to set up everything and uses make to > build everything.. This might be solvable. > 2. Maxima uses mkdefsys to compile and load lisp files. There is an > asdf file, but that's not currently used, but I believe it works. > 3. Documentation (online help) requires makeinfo and perl. > > For 2, the main issue is that gcl doesn't quite work with asdf and gcl > still needs to be suppported for windows. > > For 3, if you don't need the docs, then it's not a problem. There is > some work to build the documentation using lisp. This mostly works, > but has probably bitrotted some. > > Alexander> Also, once made loadable via quicklisp, how hard is it to make it > Alexander> useable through SLIME? > Alexander> (with maxima syntax available, perhaps, via some read macro?) > > This already works. Rupert gave the following. Place the following in > ~/.maxima/startswank.lisp: > > (require :swank) > (swank:createserver :port 56789 :dontclose t) > > Then start Maxima and run load("startswank"). To connect, do Mx > slimeconnect using the port specified above. > > You can continue to enter maxima commands in the terminal, but you can > also use slime and a lisp repl to interact with the running maxima. > > Ray > > > > >  > Learn Graph Databases  Download FREE O'Reilly Book > "Graph Databases" is the definitive new guide to graph databases and their > applications. Written by three acclaimed leaders in the field, > this first edition is now available. Download your free book today! > http://p.sf.net/sfu/13534_NeoTech > _______________________________________________ > Maximadiscuss mailing list > Maximadiscuss@... > https://lists.sourceforge.net/lists/listinfo/maximadiscuss 
From: Mario Rodriguez <biomates@te...>  20140317 15:50:04

El 17/03/14 14:45, Jorge Calvo escribió: > Or you could make it a function as follows: > > mydraw(k) := wxdraw2d(makelist(polygon([[n,n],[n+1,n],[n+1,n+1]]),n,0,k1)); > > A related question: Is there an advantage of draw(gr2d(s)) over draw2d(s) ? No, there isn't any. In fact , draw2d is an alias for draw(gr2d(s)). The draw+gr2d+gr3d mechanism is intended for general plots (including multiplots and gif animations). Both draw2d and draw3d are just particular cases.  Mario 
From: José Carlos Santos <jcsantos@fc...>  20140317 15:47:06

On 17032014 12:04, José Carlos Santos wrote: > Suppose that you load the draw package and then you run this command in > wxMaxima: > > wxdraw2d(polygon([[0,0],[1,0],[1,1]]), > polygon([[1,1],[2,1],[2,2]]), > polygon([[2,2],[3,2],[3,3]])); > > You will get, of course, three triangles. But these triangles are those > of the form polygon([n,n],[n+1,n],[n+1,n+1]), when _n_ takes the values > 0, 1, and 2. I suppose that there is a way of putting a loop inside the > draw2d command in order to get the same result without having to typeset > each polygon one by one. Am I right? Many thanks to those who replied. Best regards, Jose Carlos Santos 
From: Leo Butler <l_butler@us...>  20140317 15:26:49

> I have some Maxima code that shows some results analytically for a > paper. The paper has proofs that I wrote up manually, but a lot of the > nonessential algebra steps are skipped ("relegated to the appendix"), > they were done with Maxima. > > I would like to have the Maxima session (inputs and outputs) available > as a PDF appendix. I will of course include the Maxima source, too, but > I have to think of readers (especially referees) who don't want to run > it (either because they are not computersavvy, or don't want to invest > the time in learning yet another framework). > > It would be very nice to have outputs formatted with LaTeX, or have the > session as LaTeX code which I could compile to a PDF, maybe after some > manual editing. > > The question is: what's the recommended way of doing this? It sounds to me like you want to use emaxima. Leo 
From: Alexander Popolitov <popolit@gm...>  20140317 15:25:16

Hi everyone! Can you, please, point me to correct Maxima idiom to select elements of the list, satysfying certain criterion? The following variants: 1. grep (a la Perl) 2. filter (a la Python) 3. select (a la Mathematica) 4. removeifnot (a la Common Lisp) do not work, and my imagination is exhausted =). Of course, this could be done with going to lisplevel and doing removeifnot, but it is annoying to do that all the time... Yours sincerely, Alexandr Popolitov 
From: Jorge Calvo <Jorge.Calvo@av...>  20140317 14:00:32

Or you could make it a function as follows: mydraw(k) := wxdraw2d(makelist(polygon([[n,n],[n+1,n],[n+1,n+1]]),n,0,k1)); A related question: Is there an advantage of draw(gr2d(s)) over draw2d(s) ? Cheers, Jorge  Dr. Jorge Alberto Calvo Associate Professor of Mathematics Department of Mathematics and Physics Ave Maria University Phone: (239) 2801608 Email: jorge.calvo@...<mailto:jorge.calvo@...> Web: http://sites.google.com/site/jorgealbertocalvo From: "jfrm.maurel@...<mailto:jfrm.maurel@...>" <jfrm.maurel@...<mailto:jfrm.maurel@...>> Subject: Re: [Maximadiscuss] Loop inside draw command Date: March 17, 2014 8:26:10 AM EDT To: José Carlos Santos <jcsantos@...<mailto:jcsantos@...>>, <maximadiscuss@...<mailto:maximadiscuss@...>> Le 17/03/2014 13:04, José Carlos Santos a écrit : Hi, You will get, of course, three triangles. But these triangles are those of the form polygon([n,n],[n+1,n],[n+1,n+1]), when_n_ takes the values maybe: load(draw)$ s:makelist(polygon([[n,n],[n+1,n],[n+1,n+1]]),n,0,2); draw(gr2d(s))$ Regards  JeanFrançois MAUREL PIMECA http://www.pimeca.com 
From: Evgeniy Maevskiy <emaevskiy@e...>  20140317 12:48:43

Hello. You may try this L:makelist(obj_i,i,1,n); apply(wxdraw2d,L); where obj_i is ith graphical object (for example, polygon). 17.03.2014 15:04, José Carlos Santos пишет: > Hi all, > > Suppose that you load the draw package and then you run this command in > wxMaxima: > > wxdraw2d(polygon([[0,0],[1,0],[1,1]]), > polygon([[1,1],[2,1],[2,2]]), > polygon([[2,2],[3,2],[3,3]])); > > You will get, of course, three triangles. But these triangles are those > of the form polygon([n,n],[n+1,n],[n+1,n+1]), when _n_ takes the values > 0, 1, and 2. I suppose that there is a way of putting a loop inside the > draw2d command in order to get the same result without having to typeset > each polygon one by one. Am I right? > > Best regards, > > Jose Carlos Santos > >  > Learn Graph Databases  Download FREE O'Reilly Book > "Graph Databases" is the definitive new guide to graph databases and their > applications. Written by three acclaimed leaders in the field, > this first edition is now available. Download your free book today! > http://p.sf.net/sfu/13534_NeoTech > _______________________________________________ > Maximadiscuss mailing list > Maximadiscuss@... > https://lists.sourceforge.net/lists/listinfo/maximadiscuss > 
From: <jfrm.maurel@gm...>  20140317 12:26:27

Le 17/03/2014 13:04, José Carlos Santos a écrit : Hi, > You will get, of course, three triangles. But these triangles are those > of the form polygon([n,n],[n+1,n],[n+1,n+1]), when_n_ takes the values maybe: load(draw)$ s:makelist(polygon([[n,n],[n+1,n],[n+1,n+1]]),n,0,2); draw(gr2d(s))$ Regards  JeanFrançois MAUREL PIMECA http://www.pimeca.com 
From: José Carlos Santos <jcsantos@fc...>  20140317 12:04:31

Hi all, Suppose that you load the draw package and then you run this command in wxMaxima: wxdraw2d(polygon([[0,0],[1,0],[1,1]]), polygon([[1,1],[2,1],[2,2]]), polygon([[2,2],[3,2],[3,3]])); You will get, of course, three triangles. But these triangles are those of the form polygon([n,n],[n+1,n],[n+1,n+1]), when _n_ takes the values 0, 1, and 2. I suppose that there is a way of putting a loop inside the draw2d command in order to get the same result without having to typeset each polygon one by one. Am I right? Best regards, Jose Carlos Santos 
From: Thomas D. Dean <tomdean@wa...>  20140317 06:21:24

I do not understand exactly what is meant by the question. Maybe the maxima comment The transistion through the zero axis is a potential difficulty when taking the inverse tangent . provides a clue. Maybe you want something like: rpart:realpart(ww);ipart:imagpart(ww); /* decide what atan2(0,0) means */; ang:makelist( if equal(rpart[i],0) and equal(ipart[i],0) then inf else atan2(ipart[i],rpart[i]), i,1,n)$ yy:delete(inf,ang); plot2d([discrete,makelist(i,i,1,length(yy)),yy]); Tom Dean 
From: Edwin Woollett <woollett@ch...>  20140317 00:05:42

The present version of rk() returns **many** pagefulls of error messages when trying to integrate a stiff o.d.e., such as the van der Pol equation with large value of mu.  Maxima 5.31.2 http://maxima.sourceforge.net using Lisp GNU Common Lisp (GCL) GCL 2.6.8 (a.k.a. GCL) (%i1) stiff : rk([y2, 1000*y2*(1y1^2)  y1],[y1,y2],[2,0],[t,0,30,0.01])$ EXPT: floating point overflow. EXPT: floating point overflow. EXPT: floating point overflow. EXPT: floating point overflow. EXPT: floating point overflow. EXPT: floating point overflow. EXPT: floating point overflow. EXPT: floating point overflow. EXPT: floating point overflow. EXPT: floating point overflow. etc., etc., for **many** pages.  I have adapted the Maxima code version from ver. 5.28 dynamics.mac, and I get only one line of error return. My version is called rk4, with the same syntax as rk.  rk4(ode, var, init, domain) := block([uvw,rksoln,n,k1,k2,k3,k4,t0,t1,dt, r,numer:true,display2d:false], init : float(init), domain : float(domain), if (not(listp(ode))) then ( ode : [ode], var : [var], init : [init]), local(rkfunc), define(funmake(rkfunc,cons(domain[1],var)),float(ode)), translate(rkfunc), dt : domain[4], t0 : domain[2], n: fix((domain[3]  t0)/dt), uvw: init, if (not(numberp(last(apply(rkfunc,cons(t0,uvw)))))) then error("Expecting a number when the initial state is replaced in the equations, but instead found:" ,last(apply(rkfunc,cons(t0,uvw)))), rksoln: [cons(t0, init)], for i thru n do ( r: errcatch ( t1: domain[2]+i*dt, k1: apply(rkfunc,cons(t0,uvw)), k2: apply(rkfunc,cons((t0+t1)/2, uvw+k1*dt/2)), k3: apply(rkfunc,cons((t0+t1)/2,uvw+k2*dt/2)), k4: apply(rkfunc,cons(t1,uvw+k3*dt))), if length(r)=0 then return() else uvw: uvw + dt*(k1+2*k2+2*k3+k4)/6, t0: t1, rksoln : cons(cons(t0,uvw), rksoln)), reverse(rksoln))$  with the nice behavior (%i2) load(myrk4); (%o2) "c:/k2/myrk4.mac" (%i3) stiff : rk4([y2, 1000*y2*(1y1^2)  y1],[y1,y2],[2,0],[t,0,30,0.01])$ EXPT: floating point overflow. (%i4)  Ted Woollett 