Posts: 536
Threads: 56
Joined: Jul 2005
the Romberg version uses a refinement suggested in the 15c advanced function handbook and used by the 15c and others to redistribute the samples in a clever way. ive found this simple transform to be very effective and substantially improves this method over the usual textbook “Romberg” implementation.
Posts: 3
Threads: 0
Joined: Jan 1970
When a LF character is on the 23st place in a string, AVIEW does not show the second line, only the first line.
Regards, Ton
Posts: 875
Threads: 37
Joined: Jul 2005
Thomas,
Let me add my thanks and appreciation to those expressed by all of the others for your efforts.
What are the chances that a Pocket PC 2002/2003 version will be produced? (I reviewed the various messages and did not find any mention of this issue. If it has already been discussed, please forgive me.)
NO60hzSPAMatFORieeedotMEorg (remove NO SPAM FOR ME and change the at and dot.)
Posts: 331
Threads: 47
Joined: Oct 2005
Hi, thanks for Free42, its now running on my PC.
Can you compile a WinCE version for PPC?
Posts: 2,247
Threads: 200
Joined: Jun 2005
Algorithm
The modified Bisection alters the selection of the mid-interval guess by comparing the absolute values of the functions at the interval’s ends [a. b]. The mid-interval valuae is calculated as:
m = a + 0.25 * (b – a) if |Fa| < |Fb|
or
m = a + 0.75 * (b – a) if |Fa| >= |Fb|
P-Code
Give the root-containing interval [a, b] and the tolerance of the root:
1. Let Fa = f(a) and Fb = f(b)
2. If |Fa| < |Fb| then alpha = 0.25 else alpha = 0.75
3. m = a + alpha * (b – a)
4. Let Fm = f(m)
5. If Fm * Fa > 0 then let a = m and Fa = Fm else let b = m and Fb = Fm
6. If |a – b| > Tolerance resume at step 2
7. Return root as the value of m.
Namir