Reputation
694
Top tag
Next privilege 1,000 Rep.
See votes, expandable usercard
Badges
4 12
Newest
 Taxonomist
Impact
~14k people reached

  • 0 posts edited
  • 0 helpful flags
  • 60 votes cast
1d
comment Speed up derivative evaluation
@@Michael E2, the idea of vectorization is great. I get 20x speedup. I am curious about where does the time-saving come from? What if normalVector is also a function of θ?
2d
comment Speed up derivative evaluation
@@Bichoy, I think Compile fails for functions containing D. The compiled version is slower.
2d
comment Speed up derivative evaluation
Nice tip for speedup.
2d
accepted Speed up derivative evaluation
2d
comment Speed up derivative evaluation
`@Bichoy, great improvement ! another 15x speedup. Does compile support interpolation functions?
2d
revised Speed up derivative evaluation
added 33 characters in body
2d
asked Speed up derivative evaluation
May
3
accepted Take sublist with fixed interval
May
2
comment Take sublist with fixed interval
@2012rcampion yes, I found it in the basic examples.
May
2
revised Take sublist with fixed interval
added 33 characters in body
May
2
asked Take sublist with fixed interval
Apr
18
revised compute the gradient in high dimension
added 37 characters in body
Apr
18
comment compute the gradient in high dimension
`@Jens,Very general and comprehensive. I think the 2 in the first gradFilter function should be n. The code I provided is a little more efficient for 2 dimensional data though. :-)
Apr
18
accepted compute the gradient in high dimension
Apr
17
asked compute the gradient in high dimension
Mar
20
accepted Interpolate a discrete vector field
Mar
19
asked Interpolate a discrete vector field
Mar
15
awarded  Taxonomist
Jan
19
awarded  Yearling
Jan
6
comment Find the nearest locations for multiple points
Because of triangle inequality, no two edges of the optimal matching can cross each other. /*A Survey on Algorithms for Euclidean Matching*/