juzar18
08-28-2009, 03:46 PM
Hello Everyone,
In the nr routine polint (Numerical recipes in C second edition) after all the c and d values are evaluated we try to find the "straight line" route through the tableau to its apex. From the code it seems to me that the path followed by the code to reach the apex is a zigzag route.
1) I would like to know why is this necessary? Because any route will have the same length as long as I don't go behind.
2)What if I just take a straight route towards the apex in any one direction and make a decision only when I can go no further and have not reached the apex?
3) Does the zig-zag route help in reducing round off error? If yes how does it help because at all points c and d are arbitrary i.e. +ve or -ve.
If I just take a straight route I need to make a decision only once and not several times as the program does.
Any help would be highly appreciated.
Regards,
Juzar
In the nr routine polint (Numerical recipes in C second edition) after all the c and d values are evaluated we try to find the "straight line" route through the tableau to its apex. From the code it seems to me that the path followed by the code to reach the apex is a zigzag route.
1) I would like to know why is this necessary? Because any route will have the same length as long as I don't go behind.
2)What if I just take a straight route towards the apex in any one direction and make a decision only when I can go no further and have not reached the apex?
3) Does the zig-zag route help in reducing round off error? If yes how does it help because at all points c and d are arbitrary i.e. +ve or -ve.
If I just take a straight route I need to make a decision only once and not several times as the program does.
Any help would be highly appreciated.
Regards,
Juzar