4.8.9 · HinglishNumerical Methods

Secant method

1,655 words8 min readRead in English

4.8.9 · Maths › Numerical Methods


Secant method HAI kya?

DO starting points kyun? Kyunki ek line define karne ke liye do points chahiye. Newton ko ek point aur ek slope chahiya tha; hum slope ki jagah ek doosra point le lete hain.


KAISE — first principles se derive karo

Hum formula seedha nahi thopenge. Chalte hain build karte hain.

Step 1 — Secant line likho. Curve pe do points hain: Yeh step kyun? Yeh do sabse recent guesses hain — hum latest information use karte hain.

Step 2 — Chord ka slope. Unse guzarne wali line ka slope hai: Yeh step kyun? Yeh secant ka rise-over-run hai — yeh ko approximate karta hai. (Newton se compare karo, jo exact use karta hai.)

Step 3 — Line ki equation se guzarti hui slope ke saath:

Step 4 — Yeh -axis ko kahan cross karti hai? set karo aur use bolte hain: Yeh step kyun? Root wahan hota hai jahan ho; line ka -intercept us root ke liye hamara best linear guess hai.

Step 5 — ke liye solve karo:

Figure — Secant method

Newton's method se connection


Yeh kitni jaldi converge karta hai?

  • Newton: (quadratic).
  • Secant: (golden ratio!) — superlinear lekin quadratic se neeche.

1.618 kyun? Secant ke liye error recurrence hai (neeche prove hai). Maano . Tab . Substitute karo: ki powers match karo:


Worked Example 1 — (root )

lo.

Iteration 1: . Yeh step kyun? Do latest points ko boxed formula mein daalo.

Iteration 2: .

Iteration 3: .

Errors: — dhyan do ke har step mein sahi digits ki sankhya roughly 1.6 se multiply hoti hai.


Worked Example 2 — (root )

Koi acha sa derivative nahi chahiye. lo. Yeh step kyun? Same recipe; Secant ko koi farak nahi padta ki ka koi simple closed-form root nahi hai. Aage chalte hain toh , milta hai — pe converge ho raha hai.


Common mistakes (steel-manned)


Recall Feynman: ek 12-saal ke bacche ko samjhao

Socho ek pahaad hai jahan height exactly zero hai uss jagah jo tumhe dhundhni hai. Tum do jagah khade ho aur donou jagah apni height naapte ho. Ek seedha ruler rakho jo un donou heights ko jode. Jahan ruler zameen (zero height) ko chhoye woh tumhara agla guess hai — wahaan jao, apne do spots mein se purana wala chhod do, phir napo, aur naya ruler rakho. Har ruler seedha aur magic zero-spot ke paas hota hai, toh thodi koshishon mein tum basically wahaan pahunch jaate ho. Clever part yeh hai: tumhe kabhi nahi jaanna ki pahaad kitna steep hai — bas do heights kaafi hain.


Active-recall flashcards

Secant method iteration formula
Secant method ko kitne starting points chahiye?
Do ( aur ).
Kya Secant method ko derivative chahiye?
Nahi — yeh use finite difference (chord slope) se approximate karta hai.
Secant method ki order of convergence kya hai?
Golden ratio, (superlinear).
Secant vs Newton: kya replace hota hai?
ki jagah aata hai.
Kya Secant method ek bracketing method hai?
Nahi, yeh ek open method hai — koi guaranteed convergence nahi aur iterate interval se bahar ja sakta hai.
Secant aur Regula Falsi mein kya farak hai?
Secant hamesha do latest points use karta hai (order 1.618, no bracketing); Regula Falsi ek aisa point rakhta hai jo root bracket karta hai (bounded lekin sirf linear).
Secant, Newton se per evaluation zyada efficient kyun ho sakta hai?
Ise har step mein sirf ek naya -evaluation chahiye (koi nahi); do Secant steps () ek Newton step () ko beat kar sakte hain.
Secant formula mein numerical blow-up kya cause karta hai?
Denominator jab consecutive function values almost equal hoon.
Woh error recurrence jo order deta hai
, jisse milta hai.

Connections

  • Newton-Raphson method — Secant uska derivative-free cousin hai.
  • Regula Falsi (False Position) — same line formula, bracketing rakhta hai.
  • Bisection method — guaranteed lekin sirf linear; safety vs speed ka contrast.
  • Order of convergence result define karta hai.
  • Fixed point iteration — iterative root-finders ki broader family.
  • Finite differences — chord slope ek finite-difference derivative hai.

Concept Map

needs derivative

ugly or costly

motivates

uses

through two points

x-intercept gives

slope = rise over run

approximates

replaces f prime with slope

rearranges to

order of convergence

order

Newton-Raphson method

f prime x

Derivative problem

Secant method

Secant line / chord

Two guesses x0 x1

Iteration formula

Chord slope m

Weighted average form

p approx 1.618

p = 2 quadratic