Prev: signal reconstruction using wavelets
Next: error when trying to use 'hilbert'
From: Ahmad Alkandri on 9 May 2010 18:34
hi there

ok .... i have the following equation as an example :

ax + by

i would like to start a = 0.0000001 and b = 0.0000001 is fixed, then store y. do this until a = 1. add to b 0.0000001 and do the process again. also until b =1 .. this will cover all answers for a and b for the range of (0.0000001 to 1).
From: John D'Errico on 9 May 2010 20:04
"Ahmad Alkandri" <a_alkandri(a)yahoo.com> wrote in message <hs7d8s$spq$1(a)fred.mathworks.com>...
> hi there
>
> ok .... i have the following equation as an example :
>
> ax + by
>
> i would like to start a = 0.0000001 and b = 0.0000001 is fixed, then store y. do this until a = 1. add to b 0.0000001 and do the process again. also until b =1 .. this will cover all answers for a and b for the range of (0.0000001 to 1).

Simple. Nested loops will do it.

Of course, you will end up with 10^14 combinations
of a and b.

And you intend to store a value for each and every
combination?

Do you have the roughly 800 terabytes of memory
necessary to store all of these numbers? Or the time
necessary to generate them?

John


 | 
Pages: 1
Prev: signal reconstruction using wavelets
Next: error when trying to use 'hilbert'