Hi

I want to solve a complex non-linear equation using the Secant Method and decided to verify the algorithm with a simple function. For this test, I set the number of iterations to n, rather than check against an error threshold.

SMath gives the correct solution.

However, because the number of iterations is set by n, I would expect the calculation time to be proportional to n, but it increases very quickly as you can see from the attached file. So:

• have I done something silly in the algorithm?
• is there something different I need to do when using SMath?
• any other ideas?

Many thanks

Brian

---

Secant Method - Test.sm (6 KiB) downloaded 65 time(s).

Hi bdrunagle,

This happens because each result doesn't contains a number, but the whole set of numbers involved up to that iteration.
Use an eval at each iteration to store just the result and speed up the calculation.

---

That's just what I needed!

Thanks very much Davide.

You are welcome

Best regards,

Davide