How can I make intertwined loops faster and increase the limit of used labview memory

[Yakup1971]

thank you for your reply. Yes you wrote some of them I corrected for your advice but I do not understand your new structure but I Will try

[altenbach]

You still have most terminals without labels(!!!), piles of coercion dots, duplicate code, too many loops, wired default inputs (sample mean), terminals inside tight loops, and a completely pointless sequence structure.

---

@Yakup1971 wrote:

thank you for your reply. Yes you wrote some of them I corrected for your advice but I do not understand your new structure but I Will try

---

What exactly don't you understand??

Can you instead answer my earlier question highlighted in red?

Maybe you could explain the math behind the 4D array instead!

[Yakup1971]

How can I explain I don't know. But I will try. I have a rectangular prism and I make a grid 3D dimensional 260X260X100. then each of the grid points I have to Calculate the solid angle of 64 other coordinates. Q= [(X-Xi)^2+(Y-Yi)^2+Z^2]^3/2. But the memory is not allowed. So I am increasing the grid interval.

and then I am trying to find  min((Q-Data)^2). But this calculation part is the slowest. on the other hand, other parts may need minor correction but it is not so important for memory or slowing.

[altenbach]

---

@Yakup1971 wrote:

How can I explain I don't know. But I will try. I have a rectangular prism and I make a grid 3D dimensional 260X260X100. then each of the grid points I have to Calculate the solid angle of 64 other coordinates. d, other parts may need minor correction but it is not so important for memory or slowing.

Where do the "other 64 coordinates" come from? Can you show a picture instead of a description?

---

[Yakup1971]

İn this part for getting point value 

each top of the hill shows this coordinate
and so I am trying to calculate like this 10,000 points

[altenbach]

Your pictures don't explain the problem. The "top of the hill" is a single point. Where are the 10k points? (the 3D grid?)

can you point to literature describing the measurement and analysis and what it all means?

[Yamaeda]

---

@altenbach wrote:

Your pictures don't explain the problem. The "top of the hill" is a single point. Where are the 10k points? (the 3D grid?)

can you point to literature describing the measurement and analysis and what it all means?

---

If i were to guess i'd say it's all local maximums.

[altenbach]

I stopped guessing long ago. 😄

[Yakup1971]

ok. I think ı have explained what you asked. So is there any solution? If I make a summary. I want to calculate 260X260X100 point data (solid angle of 64 other coordinates. Q= [(X-Xi)^2+(Y-Yi)^2+Z^2]^3/2. (Xi, Yi center of my sensors coordinate and X, Y 3D space coordinate) and then ı want to compare my measuring data with this calculation to get min value.

If I put the first calculation ( 260X260X100 point data) inside the second calculation There is no memory problem but getting too slowly calculatıon. If I calculate separately at this time I am getting not enough memory warning.

On the other hand, I am sorry that I can not respond as quickly as you. Because this is my some of the hobby. and also my English is not enough to explain everything. Thanks to the Labview family.

[altenbach]

No, you really did not explain it sufficiently, at least not for me.

• So you have a 3D grid of 260x260x100 points defined by three ramps (x,y,z). (~7M points)
• Then you have 64 "other points" (sic). Where are these? Inside that same cube? At z=0?
• Does each of these 64 points correspond to a different "sensor i" (i.e. .located at at (xi, yi, z=0)
• What physical property do the sensors sense?
• Can you explain the math where Q= [(X-Xi)^2+(Y-Yi)^2+Z^2]^3/2 gives a solid angle? Can you give a link to the math? Looks more like something remotely related to distance.
• Define "min value". A comparison of a calculation and some data gives a boolean. Do you want to keep the smaller of the two?
• What is the final output? A 2D array of size 260x260 where the value is the smallest? the smallest value for each of the 64 other coordinates?

Why can't you point to a website that explains the experiment?

In any case, you definitely don't need  to pre-calculate that gigantic redundant 4D (!) array for any of this because only one value is needed at any given moment and that can be calculated right inside the main stack based on the three ramps.