Changes http://page.axiom-developer.org/zope/mathaction/AxiomMail/diff
--
William Sit wrote:
>Changes http://page.axiom-developer.org/zope/mathaction/AxiomMail/diff
>--
>
>
>Doug Stewart wrote:
>
>
>
>>But it is a constant How can I tell axiom that it is a constant?
>>I tried this way but :
Changes http://page.axiom-developer.org/zope/mathaction/AxiomMail/diff
--
Doug Stewart wrote:
> But it is a constant How can I tell axiom that it is a constant?
> I tried this way but :-(
> )clear all
> digits 20
> -- n:=x^3+a1*x^2+a2*x+a3 ::Polynomial Fraction Integer
>
> a1:=1
> a2:=1
>
Changes http://page.axiom-developer.org/zope/mathaction/AxiomMail/diff
--
Martin Rubey wrote:
>Dear Doug,
>
>there are two issues in your code:
>
>
>Doug Stewart writes:
>
>
>
>>)clear all
>>digits 20
>>-- n:=x^3+a1*x^2+a2*x+a3 ::Polynomial Fraction Integer
>>
>>Q:=(3*a2-a1^2)/9
>>R:=(9*a1*a2-27
*,
The Numerical Mathematics Consortium is pushing to develop
a portable and compatible numerical algorithms library.
http://www.nmconsortium.org/index.aspx
This effort will be important to Axiom in the long term.
Plus, as you can probably guess, I feel it's important that
they adopt a literate p
Changes http://page.axiom-developer.org/zope/mathaction/WishList/diff
--
--removed:
-
- David Mentré added:
++added:
David Mentré added:
++added:
--
forwarded from http://page.axiom-developer.org/zope/mathaction/[EMAIL PROTECTED]
___
Axiom-deve
Changes
http://wiki.axiom-developer.org/232TraceCausesBindStackOverflowFromErroneousInput/diff
--
Unfortunately, it is currently impossible to ')tr EXPR )ma', a bind stack
overflow results always. Somehow, an infinite loop is created - probably for
the output routines...
Martin
--
forwarded fro
Changes http://wiki.axiom-developer.org/231SimplifyWorkingOnMatrices/diff
--
Status: open => closed
--
forwarded from http://wiki.axiom-developer.org/[EMAIL PROTECTED]
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org
Changes http://page.axiom-developer.org/zope/mathaction/WishList/diff
--
??changed:
- This item relates to Bug #234. The LIMITPS package is outdated. We should
implement
This item relates to Bug #234. The 'LIMITPS' package is outdated. We should
implement
--
forwarded from http://page.axiom-
Changes http://page.axiom-developer.org/zope/mathaction/WishList/diff
--
??changed:
- The LIMITPS package is outdated. We should implement the MRV algorithm
described in
This item relates to Bug #234. The LIMITPS package is outdated. We should
implement
the MRV algorithm described in
--rem
Changes http://page.axiom-developer.org/zope/mathaction/WishList/diff
--
++added:
David Mentré added:
I believe there's a better, faster, more complete choice than Octave. It is
called
Scilab, and it was developed by the French INRIA (Institute Nationale De
Recherche en
Informatique et
Dear all,
Martin Rubey <[EMAIL PROTECTED]> writes:
> If you file a bug report concerning limit((-1/2)^n,n=%plusInfinity), I'll file
> a patch :-)
Today I tried to do so, but alas, the patch is not so easy... Furthermore, it
seems that it would be wasted work, because of
On Computing Limits in a
Changes http://wiki.axiom-developer.org/234Limit12NNPlusInfinity/diff
--
William Sit <[EMAIL PROTECTED]> responded via emai, and wrote, in part:
Mathematically, the limit is 2 since (-2/%pi) has absolute value less than 1,
and hence (-2/%pi)^n converges to 0. So TI-89t is correct and Axiom is wron
Changes http://wiki.axiom-developer.org/234Limit12NNPlusInfinity/diff
--
Another problem I have is that taking the limit of an expression
containing (-1)^n always returns "failed", where my TI-89 Titanium
calculator will give a finite limit. For example:
limit( 2 + (-2/%pi)^n, n=%plusInfinity )
C Y [EMAIL PROTECTED] wrote:
> Does anybody know if the axiom IRC channel is being archived anywhere?
> meme.b9.com archvies the #lisp channel and I have found that a very
> useful resource on a number of occasions. Unfortunately, I don't know
> how to reproduce the nice formatting that site give
Does anybody know if the axiom IRC channel is being archived anywhere?
meme.b9.com archvies the #lisp channel and I have found that a very
useful resource on a number of occasions. Unfortunately, I don't know
how to reproduce the nice formatting that site gives archives - anybody
know how that's
Changes http://page.axiom-developer.org/zope/mathaction/AxiomMail/diff
--
Dear Martin
> > but how then would you assert that something is in a Domain? I tried
> >
> > typeOf(3)=Integer
> >
> > but such a simple solution doesn't work.
>
> You got a quite tricky question there, really. If you are do
Changes http://page.axiom-developer.org/zope/mathaction/AxiomMail/diff
--
Hans Peter W�rmli <[EMAIL PROTECTED]> writes:
> but how then would you assert that something is in a Domain? I tried
>
> typeOf(3)=Integer
>
> but such a simple solution doesn't work.
You got a quite tricky question there
Changes http://page.axiom-developer.org/zope/mathaction/AxiomMail/diff
--
>
> Axiom is correct. "A has B" tests whether the Domain or Category A is a
> member of *Category* B or satisfies the axiom B. So
>
> Fraction Polynomial Integer has Ring
>
> or
>
> Field has Ring
>
> would return true, simil
Changes http://page.axiom-developer.org/zope/mathaction/AxiomMail/diff
--
Dear Doug,
there are two issues in your code:
Doug Stewart writes:
> )clear all
> digits 20
> -- n:=x^3+a1*x^2+a2*x+a3 ::Polynomial Fraction Integer
>
> Q:=(3*a2-a1^2)/9
> R:=(9*a1*a2-27*a3-2*a1^3)/54
> S:=(R+(Q^3+R^2)^(
Changes http://page.axiom-developer.org/zope/mathaction/AxiomMail/diff
--
Hans Peter W�rmli <[EMAIL PROTECTED]> writes:
> Hi
>
> What are my wrong expectations in the following interpreter session when
> using
> "typeOf" and "has"
>
> (1) -> e:=(1+n)/(n+k)
> n + 1
>(1) -
>
Francois Maltey <[EMAIL PROTECTED]> writes:
> Hello everybody ! Hans, Bill and others...
>
> > I am struggling with dealing with Expressions. For most sake and purposes I
> > can find a fix and solve my small problems, but I never feel very assured.
>
> I have the same problem when I try to exp
Dear Hans Peter,
Hans Peter Würmli <[EMAIL PROTECTED]> writes:
> I am struggling with dealing with Expressions. For most sake and purposes I
> can find a fix and solve my small problems, but I never feel very assured.
Yes. The EXPR domain is *not nice*
> As there doesn't seem to exist a parse
If you file a bug report concerning limit((-1/2)^n,n=%plusInfinity), I'll file
a patch :-)
Martin
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
Changes http://page.axiom-developer.org/zope/mathaction/AxiomMail/diff
--
Hi
What are my wrong expectations in the following interpreter session when using
"typeOf" and "has"
(1) -> e:=(1+n)/(n+k)
n + 1
(1) -
n + k
Type: Fractio
24 matches
Mail list logo