MathGroup Archive 2003

[Date Index] [Thread Index] [Author Index]

Search the Archive

[no subject]

  • To: mathgroup at
  • From: Dr Bob <drbob at>
  • Date: Wed, 22 Oct 2003 03:24:29 -0400 (EDT)
  • Reply-to: drbob at
  • Sender: owner-wri-mathgroup at

Here's a simple answer (not necessarily the fastest):

overlapping[{a_, b_}, {c_, d_}] := Or[a == c, a < c < b, c < a < d]
Count[Flatten@Outer[overlapping, v1, v2, 1], True]

More efficient algorithms are possible if you can guarantee the bricks in 
each list are non-overlapping and exhaustive.


recode procedural algorithm to faster functional module
Subject: [mg44079] [mg44034] recode procedural algorithm to faster functional module
From: "Prince-Wright, Robert G SEPCO" <robert.prince-wright at>
To: mathgroup at

Can someone please help me recode this Module so it is less procedural
and hopefully runs a lot faster. The Lists V1 and V2 represent two time
series with 'bricks' laid out along them. The Bricks have varying length
set by v[[i]][[1]] and v[[i]][[2]] and the idea is to count the number
of times there is an overlap. I can only see the dumb procedural way of
taking each brick and checking if it overlaps in time with another!

Concurrence[v1_List, v2_List,nsim_]:=Module [

v1[[i]][[1]] == v2[[k]][[1]], c=c+1,
v1[[i]][[1]] < v2[[k]][[1]] && v1[[i]][[2]] > v2[[k]][[1]], c=c+1,
v1[[i]][[1]] > v2[[k]][[1]] && v1[[i]][[1]] < v2[[k]][[2]], c=c+1
(*Write[ strm1, {v1[[i]][[1]],v2[[i]][[1]],c}];*)
, {i,1,nsim}
], {k,1,nsim}

I've have a PowerPoint illustration if this is unclear and can e-mail it.

Robert Prince-Wright

  • Prev by Date: Re: Can someone tell me why NDsolve isn't working here?
  • Next by Date: New version, old bugs
  • Previous by thread: Help understanding Accuracy[]
  • Next by thread: New version, old bugs