Hi,(adsbygoogle = window.adsbygoogle || []).push({});

I got one table of four columns.

e.g.

Temperature, Field, Vhall and Vdrive.

Table contains the 1000 rows.

I am given the Vhall_maesured and Vdrive_measured values.

I want to find out, which row in the table has the closest values

for Vhall and Vdrive to corresponding Vhall_maesured and Vdrive_measured.

Is there any mathematical way to find the closest row quickly.

If we can't then, we can devide this problem further:

We can have

Vhall_min and Vhall_max

Vdrive_min and Vdrive_max

And in the table we want to find any of the row( there can be more than one

but we are fine if we find any one) where Vhall and Vdrive fall between the above min and max

values.

I know computer programming and finally I want to use it in my program. Right now I am

checking each row sequencially. But I am looking the fatest to reach that point.

I have used one another method i.e. binary search and linear search combine but I am

thiking if there any way using maths of the matrix or vectro to find the row quickest.

Thanks,

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Fast way to search the table for two columns closest values

Loading...

Similar Threads for Fast search table |
---|

B I Feel Weird Using Integral Tables |

**Physics Forums | Science Articles, Homework Help, Discussion**