Mauro Gaggero
Università degli Studi di Genova
Followers: 0 Following: 0
Feeds
質問
Speed up double sum and product
Dear all, I would like to speed up the code below. It is executed thousands of times with different values for the matrix v, ...
6年以上 前 | 1 件の回答 | 0
1
回答回答済み
Find the nearest point in a regular grid
Dear Sudheer, thank you for the suggestion, the function k = dsearchn(X,XI) without triangulation does a perfect job!
Find the nearest point in a regular grid
Dear Sudheer, thank you for the suggestion, the function k = dsearchn(X,XI) without triangulation does a perfect job!
7年弱 前 | 0
回答済み
Find the nearest point in a regular grid
Dear Sudheer, thank you for your kind reply. I have checked the documentation of the function dsearchn, and I noticed that it...
Find the nearest point in a regular grid
Dear Sudheer, thank you for your kind reply. I have checked the documentation of the function dsearchn, and I noticed that it...
7年弱 前 | 0
| 採用済み
質問
Find the nearest point in a regular grid
Dear all, I would like to compute the point of a regular grid that is nearest to a given sample. I need also to keep track of...
7年弱 前 | 3 件の回答 | 0