Is page par kuch bhi assumed nahi hai. parent topic padhne se pehle, tumhe usmein likhe har squiggle ko pehchaanna hoga. Neeche, har symbol ko teen cheezein di gayi hain: simple words mein kya matlab hai, uski picture, aur method ko uske bina kyun aage nahi chal sakta. Yeh is order mein hain ki har ek sirf upar walon par depend karta hai.
Picture. Figure s01 dekho: ek single point plane mein baitha hai, apne do coordinates se describe ho raha hai.
Topic ko yeh kyun chahiye. Saara problem hai "woh special point x∗Rn mein dhundho jahan sab kuch zero ho jaata hai." Agar yeh nahi pata ki x ek point hai jo n numbers se bana hai, toh neeche wala boldface jaadoo lagta hai.
Picture. Figure s01 mein origin se point tak ka arrow wahi vector x=(x1,x2) hai. Uske do numbers hain — kitna right aur kitna upar chalna hai.
Topic ko yeh kyun chahiye. Ek dimension mein ek unknown x tha. Yahan ek saath n unknowns hain, aur unhe ek bold x mein bundle karne se hum n equations ko ek single clean line mein likh sakte hain.
Picture. Isko ek point on paper do, ek height milegi. Agar tum har point ke upar woh height plot karo, toh ek landscape milega — ek pahadi surface jo plane ke upar float kar rahi hai. Jahan height exactly 0 hai, woh jagahein floor par ek curve banati hain: us landscape ki "sea-level line".
Topic ko yeh kyun chahiye. Har equation fi=0 aslmein hai "landscape i ki sea-level line par chalo." System solve karna = woh point dhundho jahan sab sea-level lines cross hoti hain.
Picture. Figure s02 do curves draw karta hai — ek circle (f1=0) aur ek parabola (f2=0). Har ek ek landscape ki sea-level line hai. Red dot jahan yeh cross hote hain woh x∗ hai: woh akela jagah jahan dono ek saath zero hain.
Topic ko yeh kyun chahiye. Yeh crossing point poora goal hai. Newton jo kuch bhi karta hai woh is red dot ko dhundne ki machinery hai.
Matrix se pehle, hume ek honest sub-idea chahiye: ek landscape kitna steep hai agar main sirf ek direction mein chalu?
Yeh tool kyun, ordinary derivative kyun nahi? Ordinary derivative f′ ko ek variable ke function ki zaroorat hoti hai. Yahan fi kai par depend karta hai. Toh hum slope ek direction at a time poochte hain, aur curly ∂ exactly woh notation hai "slope jabki baaki sab fixed hai." Yeh f′ ka sabse chhota honest generalisation hai.
Picture. Pahaad par khado. East ki taraf munh karo aur paon ke neeche tilt feel karo — woh hai ∂f/∂x. Ab north ki taraf munh karo aur woh tilt feel karo — woh hai ∂f/∂y. Ek hi jagah par do alag steepnesses. Figure s03 ek surface slice par dono slope arrows dikhata hai.
Topic ko yeh kyun chahiye. Ek curved rule ki ek single slope nahi hoti. Ise flat ramp pretend karne ke liye hume har input direction mein uski tilt jaanni hogi — aur har tilt ek partial derivative hai.
Picture.J ko ek jagah par poore system ki "steepness report card" socho: ek row per equation, ek column per unknown. Yeh bumpy landscapes ka flat-ramp stand-in hai — Jacobian matrix literally number f′ ka n-dimensional version hai.
Topic ko yeh kyun chahiye. Newton curved F ko ek ramp se replace karta hai. n dimensions mein ek ramp exactly is grid of slopes se describe hota hai. Jacobian nahi ⇒ ramp nahi ⇒ method nahi.
Picture.Jh kehta hai: "agar main chhote vector h se step karun, toh ramp predict karta hai ki meri outputs itni change hongi." Yeh flat-ramp ka estimate hai ki F kaise move karta hai.
Topic ko yeh kyun chahiye. Core Newton equation JΔx=−F ek matrix-times-vector statement hai. Ise solve karne se pehle tum ise padhna toh jaante ho.
Topic ko yeh kyun chahiye. Har Newton step ek aisa linear solve hai. Linearizing karne ka point precisely yahi tha ki ek aisi problem tak pahuncho jo yeh toolbox pehle se crush kar leta hai.
Picture. Figure s04 error ko shrink hote dikhata hai 10−1→10−2→10−4→10−8: yeh sirf girta nahi, gota lagata hai, kyunki har step pichle ke square par feed karta hai.
Topic ko yeh kyun chahiye. Yahi payoff hai — woh reason jiske liye hum Jacobians build karna aur systems solve karna tolerate karte hain. Plain Fixed-point iteration se compare karo, jo error ko har step mein sirf ek fixed fraction se shrink karta hai (linear). xk, ek par subscript k sirf iterations count karta hai: k=0 start hai, k=1 ek step ke baad, aur aise hi.
Ise upar se neeche padho: numbers vectors bante hain, vectors F ko feed karte hain; slopes Jacobian mein stack hoti hain; Jacobian plus "zero hit karo" ki wish ek linear model deta hai; linear solver ise ek step mein badal deta hai; repeat karo, aur norm hume error ko crash hote dekhne deta hai.