http://blog.gmane.org/gmane.comp.mathematics.axiom.user hourly 1 1901-01-01T00:00+00:00 http://gmane.org/img/gmane-25t.png http://gmane.org http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1265 <pre>Hello, I'm investigating several CA systems currently and I am wondering if Axiom has certain capabilities. Specifically: (A) Differentiation through indefinite sums with respect to indexed/subscripted variables. E.g., D( sum(p[i]*x[i],i)^2, j ) --&gt; 2* p[j] * sum(p[i]*x[i],i) (B) Matrix Calculus. E.g., D( sum( p[k] * multivariate_normal(mu[k], Sigma[k]), k), Sigma[j] ) --&gt; Some large awful thing defined in equation 373 from the Matrix Cookbook, Version: November 14, 2008. As I do some work with random variables and certainty equivalents, it would be nice to find a CAS that allows me to easily double check my math. _______________________________________________ Axiom-mail mailing list Axiom-mail&lt; at &gt;nongnu.org https://lists.nongnu.org/mailman/listinfo/axiom-mail </pre> Mike Valenzuela 2013-02-26T22:14:22 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1264 <pre>take a look, see what you think http://msn.bcnews7.com/jobs/_______________________________________________ Axiom-mail mailing list Axiom-mail&lt; at &gt;nongnu.org https://lists.nongnu.org/mailman/listinfo/axiom-mail </pre> Perrin Meyer 2012-11-18T19:44:12 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1263 <pre>_______________________________________________ Axiom-mail mailing list Axiom-mail&lt; at &gt;nongnu.org https://lists.nongnu.org/mailman/listinfo/axiom-mail </pre> Osman Kadiroğlu 2012-11-11T07:55:54 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1261 <pre>Good evening, I've been experiencing a hard time using the resultant function. The resultant between two univariative polynomials can be defined as the determinant of the Sylvester Matrix of said polynomials ( http://en.wikipedia.org/wiki/Sylvester_matrix). That being said, it should be always posible to find out the resultant of two polynomials. So, I've been trying to find out 2 polynomials, *f(x)* and *g(x)*, that satisfy: 1. f(x) should be of degree *n*, monic and irreducible over the integers. 2. g(x) should be of degree at most *n*, and its coefficients should vary from a determined range. 3. resultant(f, g) should be a prime number My algorithm should first choose an satisfying f(x) and then sample random g(x) that satisfies the second condition until it gets a prime resultant. I'm sending an input to show how I'm trying to achieve this, and hopefully, enlight about my problem. That being said, I'm having trouble trying to execute my algorithm as I end up with a message like "can't find a definition or applicable library (...) with arguments Polynomial Integer and Polynomial Integer". I'm sending a picture of the error as well. But, if I try to calculate the resultant of the same 2 polynomials, with the same types and all, I can do it, without a problem! The trickier part is that sometimes the input runs without a problem, and sometimes it doesn't. This problem is killing me as I can't figure out why I'm getting this. I'm sending both the .input with all needed and the screen with the error. If anyone needs any further information, you can ask, I'm about to go and define the Sylvester Matrix of them myself, but can't figure why it works sometimes... Best regards. _______________________________________________ Axiom-mail mailing list Axiom-mail&lt; at &gt;nongnu.org https://lists.nongnu.org/mailman/listinfo/axiom-mail </pre> Gabriel Pires 2012-06-24T00:08:12 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1256 <pre>Can someone tell me if the following can be solved in Axiom, and hence whether I should bother learning the system? I have two equations in vectors of arbitrary dimension: z = y + ax (a is scalar, x,y,z vector) &amp; p^t z = 0 (p another vector). Vectors x,y,p are known, vector z and scalar a are unknown. Assume no two known vectors are orthogonal. The solution of this is z = y + a x where a = -(p^t y) / (p^t x). Is this expressible and solvable in Axiom? Victor. _______________________________________________ Axiom-mail mailing list Axiom-mail&lt; at &gt;nongnu.org https://lists.nongnu.org/mailman/listinfo/axiom-mail </pre> Victor Eijkhout 2012-06-01T07:37:07 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1255 <pre>----------------------------------------------------------------------- Gerald Farmer wants to stay in better touch using some of Google's coolest new products. If you already have Gmail or Google Talk, visit: http://mail.google.com/mail/b-8f9108acc5-b70c1f5a62-98B9rxwoo2CZUzKjPzpxFC70bdk You'll need to click this link to be able to chat with Gerald Farmer. To get Gmail - a free email account from Google with over 2,800 megabytes of storage - and chat with Gerald Farmer, visit: http://mail.google.com/mail/a-8f9108acc5-b70c1f5a62-98B9rxwoo2CZUzKjPzpxFC70bdk Gmail offers: - Instant messaging right inside Gmail - Powerful spam protection - Built-in search for finding your messages and a helpful way of organizing emails into "conversations" - No pop-up ads or untargeted banners - just text ads and related information that are relevant to the content of your messages All this, and its yours for free. But wait, there's more! By opening a Gmail account, you also get access to Google Talk, Google's instant messaging service: http://www.google.com/talk/ Google Talk offers: - Web-based chat that you can use anywhere, without a download - A contact list that's synchronized with your Gmail account - Free, high quality PC-to-PC voice calls when you download the Google Talk client We're working hard to add new features and make improvements, so we might also ask for your comments and suggestions periodically. We appreciate your help in making our products even better! Thanks, The Google Team To learn more about Gmail and Google Talk, visit: http://mail.google.com/mail/help/about.html http://www.google.com/talk/about.html (If clicking the URLs in this message does not work, copy and paste them into the address bar of your browser). </pre> Gerald Farmer 2012-01-23T20:23:27 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1254 <pre>LinkedIn ------------ I'd like to add you to my professional network on LinkedIn. - Xiaojun Xiaojun Liu Lecturer at China Agricultural University China Confirm that you know Xiaojun Liu: https://www.linkedin.com/e/axlfn-gxmla1h6-f/isd/5589027699/gkD0Or3N/?hs=false&amp;tok=26kdt_gnjPuB41 -- You are receiving Invitation to Connect emails. Click to unsubscribe: http://www.linkedin.com/e/axlfn-gxmla1h6-f/qPHmxGMfIcq2wXu91D8_SVWfujzEMLQTTW/goo/axiom-mail%40nongnu%2Eorg/20061/I1944216588_1/?hs=false&amp;tok=3nqeFkm9rPuB41 (c) 2011 LinkedIn Corporation. 2029 Stierlin Ct, Mountain View, CA 94043, USA. _______________________________________________ Axiom-mail mailing list Axiom-mail&lt; at &gt;nongnu.org https://lists.nongnu.org/mailman/listinfo/axiom-mail </pre> Xiaojun Liu 2012-01-20T02:27:18 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1252 <pre>Hello, Is there a GUI for axiom? Something analogous to wxMaxima for axiom... Cheers, Daniel. </pre> Daniel Carrera 2011-11-25T20:01:05 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1250 <pre>People, please, how can I download the axiom source? The page of http://www.axiom-developer.org/axiom-website/download.html says ----------------------------- The Gold (November 2008) release of Axiom is available. The source code tarball from November, 2008 is here wget http://axiom.axiom-developer.org/axiom-website/downloads/axiom-july2008-src.tgz ----------------------------- I command this and obtain the result --------- connected with axiom.axiom-developer.org|209.135.140.38|:80... HTTP request sent, ... 404 Not Found --------- Please, answer to mechvel&lt; at &gt;botik.ru Thank you in advance for explanation. Regards, ------ Sergei </pre> Serge D. Mechveliani 2011-11-02T10:53:15 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1246 <pre>Hmm, that's a new one. What operating system and version of OS are you using? I'll build a machine and try to recreate it. Tim </pre> daly 2011-08-18T00:16:49 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1244 <pre>I compiled and installed 201107 today. When I run it, axiom and hyperdoc open OK, browsing in hyperdoc works, but axiom itself fails with, eg: AXIOM Computer Algebra System Version: Axiom (July 2011) Timestamp: Wednesday August 17, 2011 at 16:48:12 ----------------------------------------------------------------------------- Issue )copyright to view copyright notices. Issue )summary for a summary of useful system commands. Issue )quit to leave AXIOM and return to shell. Visit http://axiom-developer.org for more information ----------------------------------------------------------------------------- Re-reading compress.daase Re-reading interp.daase Re-reading operation.daase Re-reading category.daase Re-reading browse.daase (1) -&gt; (1) -&gt; m: MPOLY([x,y],INT) := (x**2 - x*y**3 + 3*y)**2 1) -&gt; &gt;&gt; System error: Can't open file "/opt/axiom/algebra/INT.data" There are no .data files there, just .o files. The build log shows: compiling INT.lsp to INT.o compiling INT.spad to INT.nrlib copying INT.nrlib to INT.o but no mention of INT.data. An strace(8) shows that it looked for INT.data immediately after reading in INT.o. I'm at a bit of a loss of where to go from here. The bug which prevented 201101 from working is gone, but it still fails. What is needed to get this to work? (Fricas and open-axiom are no better; they both dump into a lisp debugger when run.) -JimC </pre> James Cloos 2011-08-17T22:05:07 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1241 <pre>Hay all, good evening =), Well, I'm having some problems in understanding the way "IndexedExponents" work. I'm trying to use the RESRING domain, to create and manipulate Residue Rings. I managed to properly create one object from ResidueRing by doing: R := FRAC(INT) -- defining the field ls : List Symbol := [x] V := OVAR(ls) </pre> Gabriel Pires 2011-04-08T22:28:01 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1240 <pre>--- getting wildly different performance from these definitions --- --- compiler likes fib2 )clear all fib(n) == n &lt; 1 =&gt; error("fib : n less than 1") n = 1 =&gt; 1 n = 2 =&gt; 2 n &gt; 2 =&gt; fib(n-1) + fib(n-2) fib2(n : Integer) : Integer == if n &lt; 1 then error("fib2 : n less than 1") else if n = 1 then 1 else if n = 2 then 2 else fib2(n-1) + fib2(n-2) fib3(n : PositiveInteger) : PositiveInteger == if n &lt; 1 then error("fib3 : n less than 1") else if n = 1 then 1 else if n = 2 then 2 else fib3(n-1) + fib3(n-2) )set fun cache all fib fib2 fib3 --- --- --- --- --- In general, interpreter functions will cache all values. --- (4) -&gt; fib(10) --- There are 15 exposed and 5 unexposed library operations named + --- having 2 argument(s) but none was determined to be applicable. --- Use HyperDoc Browse, or issue --- )display op + --- to learn more about the available operations. Perhaps --- package-calling the operation or using coercions on the arguments --- will allow you to apply the operation. --- Cannot find a definition or applicable library operation named + --- with argument type(s) --- Void --- Void --- Perhaps you should use "&lt; at &gt;" to indicate the required return type, --- or "$" to specify which version of the function you need. --- AXIOM will attempt to step through and interpret the code. --- (4) 89 --- Type: PositiveInteger --- Time: 0.05(A) + 0.01(E) + 0.02(M) + 0.01(K) = 0.09 sec --- (5) -&gt; fib(20) --- (5) 10946 --- Type: PositiveInteger --- Time: 2.35(A) + 0.08(C) + 0.24(E) + 0.38(G) + 0.05(H) + 0.12(I) + 0.83(M) + 5.21(K) = 9.26 sec --- (6) -&gt; fib2(20) --- Compiling function fib2 with type Integer -&gt; Integer --- fib2 will cache all previously computed values. --- (6) 10946 --- Type: PositiveInteger --- Time: 0.01(T) = 0.01 sec --- (7) -&gt; fib3(20) --- There are no library operations named fib3 --- Use HyperDoc Browse or issue --- )what op fib3 --- to learn if there is any operation containing " fib3 " in its --- name. --- Cannot find a definition or applicable library operation named fib3 --- with argument type(s) --- Integer --- Perhaps you should use "&lt; at &gt;" to indicate the required return type, --- or "$" to specify which version of the function you need. --- AXIOM will attempt to step through and interpret the code. --- Compiling function fib3 with type PositiveInteger -&gt; PositiveInteger --- fib3 will cache all previously computed values. --- (7) 10946 --- Type: PositiveInteger --- Time: 2.32(A) + 0.14(C) + 0.16(E) + 0.53(G) + 0.05(H) + 0.67(M) + 5.75(K) + 0.02(R) = 9.60 sec --- (8) -&gt; --- GCL (GNU Common Lisp) 2.6.7 CLtL1 Nov 5 2010 16:04:47 --- Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) --- Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC) --- Modifications of this banner must retain notice of a compatible license --- Dedicated to the memory of W. Schelter --- Use (help) to get some basic information on how to use GCL. --- Temporary directory for compiler files set to /tmp/ --- AXIOM Computer Algebra System --- Version: Axiom (September 2010) --- Timestamp: Sunday November 7, 2010 at 00:00:45 --- ---------------------------------------------------------------------------- </pre> terence cadd 2010-12-05T14:45:49 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1235 <pre>Hello! I am working on a program that takes quite a long time to execute, and I wanted to be able to save the intermediate results to an output and to load it later in another session, so that I wouldn't need to run the program overnight everytime. I want to run a bit, save the important variables, be able to close the session, shut down my computer and continue running later. Or if there is a way to save the entire state of the session, that would work as well. The spool command won't work, because it won't print the output in a format that is readable later as an input by Axiom. If there is a way to do it, please let me know! Thanks in advance! _______________________________________________ Axiom-mail mailing list Axiom-mail&lt; at &gt;nongnu.org http://lists.nongnu.org/mailman/listinfo/axiom-mail </pre> Rodrigo Canaan 2010-11-10T18:40:15 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1234 <pre>_______________________________________________ Axiom-mail mailing list Axiom-mail&lt; at &gt;nongnu.org http://lists.nongnu.org/mailman/listinfo/axiom-mail </pre> Osman Kemal Kadiroglu 2010-07-31T10:52:59 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1232 <pre>CICM 2010 Call for participation Please apolgy for multiple copies We are pleased to announce CICM 2010 which will take place at Conservatoire National des Arts et Métiers in Paris, France from July 5 to July 10, 2010. This continues the CICM series begun with the successful CICM 2008 in in Birmingham, England and CICM 2009 in Grand Bend, Ontario, Canada. Please visit http://cicm2010.cnam.fr/ Conferences on Intelligent Computer Mathematics gather several conferences: - 10th International Conference onArticficial Intelligence and Symbolic Computation (AISC 2010) - 17th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning (Calculemus 2010) - 9th International Conference on Mathematical Knowledge Management (MKM 2010) Associated Workshops are: - 3rd Workshop on Compact Computer Algebra (CCA 2010) - 3rd Workshop, Towards a Digital Mathematics Library (DML 2010) - 4th Workshop on Programming Languages for Mechanized Mathematics (PLMMS 2010) - 23rd Workshop on OpenMath (OpenMath) - Mathematically Intelligent Proof Search (MIPS 2010) - 6th Workshop on Mathematical User-Interfaces (MathUI 2010) - Content Math Training Camp with Doctoral Programme (CMTC+DP) Further events include: - A ScienCe Eu project meeting - The EuDML European project kickoff meeting - A program for doctoral students - A special training camp on Content Markup for Mathematics - A day program in honour of Therese Hardin Social Events - Conference reception with Wine &amp; Cheese buffet at the "Cafe des Techniques" at the CNAM Museum. - Conference Banquet at restaurant le Grand Bleu, Port de l'Arsenal. The full list of events is at http://cicm2010.cnam.fr/programme.html Looking forward to see you in Paris. Laurence Rideau, Renaud Rioboo </pre> Renaud.Rioboo< at >ensiie.fr 2010-06-11T13:21:16 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1231 <pre> I am experiencing a problem with the keyboard which is rather annoying. If I call back a command from history using the up arrow and then I modify it (moving the cursor with the arrow keys, deleting with backspace and writing new test) the result is completely messed up. This happens in a terminal window but not on the console shell, so I guess it depends on some settings, but I can't figure out which. I am working on ubuntu (64 bit) 10.04, with gnome terminal (but the same happens also in xterm) with axiom version from the repository, that is Version: Axiom (November 2009) Timestamp: Thursday April 8, 2010 at 18:12:43 An esample of my problem is as follows: type ----------------- (1) -&gt; [[1,2]] (1) -&gt; (1) [[1,2]] ----------------- Now, assume I want to change the "1" into a "3". I go back with the left arrows then I delete it with "Backspace" (BTW: "delete" doesn't work at all in the term: it gives "^[[3~", while it works in the shell) What I get is the following: ----------------- (2) -&gt; [[3,]]] Line 1: [[3,]]] ....A Error A: syntax error at top level Error A: Improper syntax. 2 error(s) parsing ----------------- Please observe that the "2" disappears as soon as I delete the "1" (and, in the same moment, the extra "]" appears). Another small question: is the Kronecker product between matrices implemented somewhere? Thanks a lot Fabio </pre> Fabio S. 2010-06-08T09:19:16 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1230 <pre> --- On Fri, 6/4/10, £ukasz &lt;blurrpp&lt; at &gt;yahoo.com&gt; wrote: Hi thanks for answers. There are many reeasons, for example i wrote fast noncomutative algebra in assembler using SSEX etc. multicores CPU GPGPU and i want to use it with some CAS ( of course i didnt wrote whole CAS ;) ). Yep i can use pipelines or sth. to establish communication betwen my program and some CAS but its waste of "cycles" :). Any way thakn You for link its useful. Im just cheacking free CAS which can give me more flexibility ( implement for example C function in REDUCE is more complex , in SINGULAR not so etc. but its look like AXIOM has adv in this field) Lukas </pre> £ukasz 2010-06-04T18:44:49 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1227 <pre>Hi. I want to ask if its possibe to write some finction in C and aply it in AXjOM ( its possibe in MATHEMATICA. SINGULAR, YACAS etc). If it is please give me some links. Regards Lukas </pre> £ukasz 2010-06-04T09:25:46 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1225 <pre>_______________________________________________ Axiom-mail mailing list Axiom-mail&lt; at &gt;nongnu.org http://lists.nongnu.org/mailman/listinfo/axiom-mail </pre> Joke de Buhr 2010-05-07T20:19:30 http://comments.gmane.org/gmane.comp.mathematics.axiom.user/1222 <pre>Hi, I was happy to finally get my hands on Axiom after nearly 20 years. So, I was overjoyed that Ubuntu 9.10 had a ready-to-go package. However, there is a cloud over paradise. Open Axiom fails to properly initialise. The hardware is Intel Quad Core CPU, the OS is Ubuntu 9.10 AMD 64. I keep the CPU microcode up-to-date. Appended is the rather cryptic output I captured. I would certainly appreciate some help. Byron Hale byron&lt; at &gt;U9:~$ axiom GCL (GNU Common Lisp) 2.6.7 CLtL1 Nov 10 2006 14:25:02 Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl) Binary License: GPL due to GPL'ed components: (XGCL READLINE BFD UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files set to /tmp/ AXIOM Computer Algebra System Version: Axiom 3.9 (September 2005) Timestamp: Saturday December 2, 2006 at 09:30:31 ----------------------------------------------------------------------------- Issue )copyright to view copyright notices. Issue )summary for a summary of useful system commands. Issue )quit to leave AXIOM and return to shell. ----------------------------------------------------------------------------- Re-reading compress.daase Re-reading interp.daase Re-reading operation.daase Re-reading category.daase &gt;&gt; System error: Couldn't protect Error: The tag |top_level| is undefined. Fast links are on: do (si::use-fast-links nil) for debugging Error signalled by RETURN. Broken at APPLY. Type :H for Help. BOOT&gt;&gt; </pre> Byron Hale 2010-04-28T06:05:23 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.comp.mathematics.axiom.user