I wonder how Mathematica or Maple would do on
the example? FYI, the coefficients are:
c=: p. 1;(i.20),20+1r10000
$ c
22
,. c
0
12164570863433404416r5
_218824779831907044096r25
1725478326826717264416r125
_8044370160474101780736r625
40189244805618931494r5
_449999457615157526487r125
150831628733838701409r125
_389168673156362042987r1250
12606212497034088551r200
_20284676115434000439r2000
1307539638605170191r1000
_1355856294222057381r10000
1131031122063219r100
_756113253793363r1000
4017186902419r100
_8361421558473r5000
10665607611r200
_2513703363r2000
20615019r1000
_2100001r10000
1
----- Original Message -----
From: Raul Miller <[EMAIL PROTECTED]>
Date: Monday, July 28, 2008 7:52
Subject: Re: [Jprogramming] Roots robustness?
To: Programming forum <[email protected]>
> Perhaps not surprisingly:
> q=:1;(i.20),20+1r10000
> roots=: 1&{::@p.
> p=:p. q
> r=:roots p
> >./|p&p.r
> 0
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
