Velocity Reviews > C++ > Looking for help with a loop algorithm

# Looking for help with a loop algorithm

Kasterborus
Guest
Posts: n/a

 01-09-2008
I'm having trouble writing a loop using integer math that will
spit out 10 numbers and slowly make them all tend to 2048.

Ideally this loop should take about 400 iterations, and with each pass
calculate 10 values

i.e:

Starting iteration:
0 455 910 1365 1820 2275 2730 3185 3640 4095

Ending iteration:
2048 2048 2048 2048 2048 2048 2048 2048 2048 2048

(or as close as can be eg.
2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 ).

I can successfully make an 11 value sequence work, but 10 is proving
to be tricky...

Anyone know how to do this?

Steve

Erik Wikström
Guest
Posts: n/a

 01-09-2008
On 2008-01-09 19:20, Kasterborus wrote:
> I'm having trouble writing a loop using integer math that will
> spit out 10 numbers and slowly make them all tend to 2048.
>
> Ideally this loop should take about 400 iterations, and with each pass
> calculate 10 values
>
> i.e:
>
> Starting iteration:
> 0 455 910 1365 1820 2275 2730 3185 3640 4095
>
> Ending iteration:
> 2048 2048 2048 2048 2048 2048 2048 2048 2048 2048
>
> (or as close as can be eg.
> 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 ).
>
> I can successfully make an 11 value sequence work, but 10 is proving
> to be tricky...
>
> Anyone know how to do this?

Nope, but those guys over in comp.programming might.

--
Erik Wikström

Victor Bazarov
Guest
Posts: n/a

 01-09-2008
Kasterborus wrote:
> I'm having trouble writing a loop using integer math that will
> spit out 10 numbers

Split out from where or by what criterion?

> and slowly make them all tend to 2048.

What does it mean to "tend to N"? You might want to explain it when
you repost to the appropriate newsgroup. How "slowly" does it need
to happen? By steps of 1 or 10 or (2048-N)*0.66667 ?

> Ideally this loop should take about 400 iterations,

How do you know?

> and with each pass
> calculate 10 values
>
> i.e:
>
> Starting iteration:
> 0 455 910 1365 1820 2275 2730 3185 3640 4095
>
> Ending iteration:
> 2048 2048 2048 2048 2048 2048 2048 2048 2048 2048
>
> (or as close as can be eg.
> 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 ).
>
> I can successfully make an 11 value sequence work, but 10 is proving
> to be tricky...

What's the problem you're seeing? "Proving to be tricky" is not really
a good description of the problem you're running into.

> Anyone know how to do this?

I believe you're in the wrong newsgroup. For help on generic algorithms
like the one you're seeking, try 'comp.programming'.

V
--

Leclerc
Guest
Posts: n/a

 01-09-2008

you might do a google with ARMAX, ARX, AR, "output error", "Box-Jenkins"
.....

Daniel T.
Guest
Posts: n/a

 01-09-2008
Kasterborus <(E-Mail Removed)> wrote:

> I'm having trouble writing a loop using integer math that will
> spit out 10 numbers and slowly make them all tend to 2048.
>
> Ideally this loop should take about 400 iterations, and with each pass
> calculate 10 values
>
> i.e:
>
> Starting iteration:
> 0 455 910 1365 1820 2275 2730 3185 3640 4095
>
> Ending iteration:
> 2048 2048 2048 2048 2048 2048 2048 2048 2048 2048
>
> (or as close as can be eg.
> 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 ).
>
> I can successfully make an 11 value sequence work, but 10 is proving
> to be tricky...

Care to share the code? Maybe if you do we can show a simple edit that
will do the trick.

nullius.filius@gmail.com
Guest
Posts: n/a

 01-10-2008
x-no-archive: yes

What you are looking for is called a "fixed point" search. This is
when you apply a function to a guess (which improves the guess),
and then apply the function to the improved guess.

As a trivial example of a "fixed point" search, you might average
your guess with your fixed point and then use the result as an
improved guess. For example, if I want to converge to the point
42, then I might use this averaging formula:

x = (x + 42)/2

Of course if I want to converge to 2048, I would not use 42, but
an entirely different value.

Kasterborus wrote:
> I'm having trouble writing a loop using integer math that will
> spit out 10 numbers and slowly make them all tend to 2048.
>
> Ideally this loop should take about 400 iterations, and with each pass
> calculate 10 values
>
> i.e:
>
> Starting iteration:
> 0 455 910 1365 1820 2275 2730 3185 3640 4095
>
> Ending iteration:
> 2048 2048 2048 2048 2048 2048 2048 2048 2048 2048
>
> (or as close as can be eg.
> 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 ).
>
> I can successfully make an 11 value sequence work, but 10 is proving
> to be tricky...
>
> Anyone know how to do this?
>
> Steve

 Posting Rules You may not post new threads You may not post replies You may not post attachments You may not edit your posts BB code is On Smilies are On [IMG] code is On HTML code is OffTrackbacks are On Pingbacks are On Refbacks are Off Forum Rules

 Similar Threads Thread Thread Starter Forum Replies Last Post Isaac Won Python 9 03-04-2013 10:08 AM Bapaiah Katepalli VHDL 1 06-23-2006 04:50 PM Allerdyce.John@gmail.com C++ 17 01-20-2006 12:20 AM Andy Baxter Perl Misc 5 01-02-2004 08:48 PM Ahmed Moustafa Java 0 11-15-2003 06:35 AM