Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °

You are not logged in.

- Topics: Active | Unanswered

Pages: **1**

**Raabi****Member**- Registered: 2012-11-22
- Posts: 18

Hello Wizards

This time, I came up with another confusion on the subject. Just over-viewing the subject, I found two entirely different (apparently, at least) formulae for the method. One is:

x1 = [a * f(b) - b*f(a)] / [f(b) - f(a)]; where a and b are two guess points.

The other is:

x = [xn - x(n-1)] / [f((xn) - f(xn-1)] * f(xn)

Are these two formulae actually the same or different for their use in different situations. Please help keeping in mind that I am just a toddler in this branch of mathematics.

I hope and wish * bobbym *is somewhere around.

Thanks in anticipation.

Raabi

Offline

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 85,303

Hi;

The first one I recognize as the false position method.

The second one is slightly off.

No matter how it is phrased it is not my favorite choice for obtaining roots.

**In mathematics, you don't understand things. You just get used to them.Of course that result can be rigorously obtained, but who cares?Combinatorics is Algebra and Algebra is Combinatorics.**

**Online**

**Raabi****Member**- Registered: 2012-11-22
- Posts: 18

ok, thanks and regards.

Raabi

Offline

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 85,303

Hi;

There is also if I remember a slight difference between the secant method and regula falsi.

**In mathematics, you don't understand things. You just get used to them.Of course that result can be rigorously obtained, but who cares?Combinatorics is Algebra and Algebra is Combinatorics.**

**Online**

**Raabi****Member**- Registered: 2012-11-22
- Posts: 18

Well, let me explore Secant method, and thanks again for your attention.

Offline

Pages: **1**