<div dir="ltr"><div class="gmail_default" style="font-size:small">Yun,</div><div class="gmail_default" style="font-size:small"><br></div><div class="gmail_default" style="font-size:small">I'm sorry somebody didn't get back to you sooner.</div><div class="gmail_default" style="font-size:small"><br></div><div class="gmail_default" style="font-size:small">I don't know much about bin_sum, but I'm pretty sure we don't have a curvilinear version. </div><div class="gmail_default" style="font-size:small"><br></div><div class="gmail_default" style="font-size:small">However, you might be able to speed up your loop calculations simply by getting rid of the loop entirely or moving as much of the code out of the loop as possible. You can take advantage of NCL's array arithmetic capabilities, which could significantly speed up your routine. If you could send us the loop snippet, then we'll see if it can be improved.</div><div class="gmail_default" style="font-size:small"><br></div><div class="gmail_default" style="font-size:small">Or, if you need to go the Fortran route, then you can use WRAPIT: </div><div class="gmail_default" style="font-size:small"><br></div><div class="gmail_default" style="font-size:small"> <a href="https://www.ncl.ucar.edu/Document/Tools/WRAPIT.shtml">https://www.ncl.ucar.edu/Document/Tools/WRAPIT.shtml</a></div><div class="gmail_default" style=""><br></div><div class="gmail_default" style="">Please post back to ncl-talk if you have further questions about this.</div><div class="gmail_default" style=""><br></div><div class="gmail_default" style="">--Mary</div><div class="gmail_default" style=""><br></div></div><div class="gmail_extra"><br><div class="gmail_quote">On Tue, Mar 29, 2016 at 4:35 PM, Yun Yue <span dir="ltr"><<a href="mailto:yunyue@huskers.unl.edu" target="_blank">yunyue@huskers.unl.edu</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div dir="ltr">
<div style="font-size:12pt;color:#000000;background-color:#ffffff;font-family:Calibri,Arial,Helvetica,sans-serif">
<p><span style="font-size:12pt">Hi NCL users,</span><br>
</p>
<p></p>
<p><span>I want to read many MODIS files. For each satellite pixel, find the nearest WRF grid based on lat, lon information (used function ind here to reduce the calculation time), then assign the MODIS data to this WRF grid. </span></p>
<p><span></span><br>
</p>
<p><span>I found that using loop in NCL to calculate each satellite pixel’s distance to the WRF grid is very slow. </span></p>
<p><span></span><br>
</p>
<p><span>One way I’m thinking to solve this is to use FORTRAN in the NCL to do the loop part. </span></p>
<p><span></span><br>
</p>
<p><span>I also found NCL has a function bin_sum to calculate binned sums and counts on a rectilinear grid which is very fast. Is there a similar function in NCL like bin_sum but for curvilinear grid?</span></p>
<p><span></span><br>
</p>
<p><span>Thanks very much,</span></p>
<p><span>Yun</span></p>
<br>
<p></p>
<div>
<div style="font-size:12pt;color:#000000;background-color:#ffffff;font-family:Calibri,Arial,Helvetica,sans-serif">
<div name="divtagdefaultwrapper">
<div><br>
</div>
</div>
</div>
</div>
</div>
</div>
<br>_______________________________________________<br>
ncl-talk mailing list<br>
<a href="mailto:ncl-talk@ucar.edu">ncl-talk@ucar.edu</a><br>
List instructions, subscriber options, unsubscribe:<br>
<a href="http://mailman.ucar.edu/mailman/listinfo/ncl-talk" rel="noreferrer" target="_blank">http://mailman.ucar.edu/mailman/listinfo/ncl-talk</a><br>
<br></blockquote></div><br></div>