Thank you, Raul, especially for the "short form". I'll try at least the Wiki
article. --Kip
Sent from my iPad
On Mar 1, 2013, at 7:50 AM, Raul Miller wrote:
> For readers following along:
>
> IEEE 754 is a decent search term.
>
> Or, at least, it is for me - Google apparently customizes s
That's pretty good! Thank you, Arne. --Kip
Sent from my iPad
On Mar 1, 2013, at 6:45 AM, Aai wrote:
> Here's a conjunction with the choice of left/right approach.
>
> It's like Raul's approach except it uses a bit more values and it compares
> successive values up to a limited number of de
I think the machine epsilon concept
http://en.wikipedia.org/wiki/Machine_epsilon#Formal_definition )
is related to this thread discussion...
(%&2^:(1 (~:!.0) 1 + %&2)^:_)1 NB. 2^_52 as expected
2.22044605e_16
On Fri, Mar 1, 2013 at 8:50 AM, Raul Miller wrote:
> For readers following along:
>
Interesting. I was just churning through an explicit conjunction for the
two-monad case when I saw this. That was a fun little exercise, but then I
wondered about the general case, and then I saw your email. The timing was
excellent.
The main complication that I was wondering about was having (, x
I apologize for being late on this thread.
The limit in question does not require the full fire-power of Wolfram
Alpha, adequate though that might be: I would expect a Calculus I student
to be able to figure it out.
The only non-obvious fact is (sin h)/h->1 as h->0, which you need so that
you can
Here's a generalized approach (not necessarily better, but convenient
if you need a variety of these kinds of sequences):
Alternating=: (1 :0)("0)
(+#) {. (, (altSeq/m)`:6)@]^:((#m) >.@%~ [)
)
altSeq=:4 :0
(, x`:6@{:)@(y`:6@{:)`''
)
Here's a couple examples:
9 +:`>: Alternating 1
1 2 4 5
For readers following along:
IEEE 754 is a decent search term.
Or, at least, it is for me - Google apparently customizes search
results so I cannot know for sure that they give good, relevant
results for everyone searching on that phrase (nor can I be sure
whether anyone I care about will get dif
Here's a conjunction with the choice of left/right approach.
It's like Raul's approach except it uses a bit more values and it
compares successive values up to a limited number of decimals.
limit=: 2 :'({~1 i.~(}.=}:))<.&.((10^11)&*) u y v 0.5^i.1076'
tests:
((4%~])* 3 o. 1r2p1 * 1-]) lim
Here's a modification of Raul's idea:
f=: 13 :'(i.y){((,[:(,+:)[:>:{:)^:(<.-:y))x'
1 f 4
1 2 4 5
1 f 7
1 2 4 5 10 11 22
3 f 7
3 4 8 9 18 19 38
Linda
-Original Message-
From: programming-boun...@forums.jsoftware.com
[mailto:programming-boun...@forums.jsoftware.com] On Behalf O
Different approach by analyzing the sequence
+/\1,,1,.+/\2,3*2^i.4
1 2 4 5 10 11 22 23 46 47 94
Or shorter:
,(,.>:)+/\1,3*2^i.3
1 2 4 5 10 11 22 23
--
Met vriendelijke groet,
@@i = Arie Groeneveld
--
For information
Different approach by analyzing the sequence
+/\1,,1,.+/\2,3*2^i.4
1 2 4 5 10 11 22 23 46 47 94
On 28-02-13 23:21, Johann Hibschman wrote:
Thanks, that's interesting. It seems a little cumbersome, but it certainly
works.
It seems to do a lot of appending, but since it's continually buildi
11 matches
Mail list logo
