maths.free › Numerical Methods › Floating point and error
Floating point and error
Why 0.1 + 0.2 ≠ 0.3 on a computer, and how error propagates.
Computers store numbers in binary with ~16 significant digits; 0.1 is not representable exactly. Round-off accumulates, and subtracting nearly equal numbers destroys digits (cancellation). Picture it: 255 in binary is 11111111, and 0.1 in binary never terminates. Think it: a stable algorithm keeps error growth linear; conditioning is a property of the problem, stability of the method.
कार्यरत उदाहरण · 0.1 + 0.2
चरणानुक्रमे
- 0.3 = \frac{3}{10}
Add: 0.1 + 0.2 = 3/10.
- \frac{3}{10} = 0.3
Simplify.
उत्तर उघडा
आता तुम्ही प्रश्न निवडा, किंवा स्वतःचा प्रश्न टाइप करा किंवा रेखाटून दाखवा. प्रत्येक टप्प्यात, चित्रे आहेत, तुम्ही विचारण्याआधी उत्तर लपवलेले आहे.
मोफत खाते प्रत्येक शिकवणी वर टिपण्णी जोडते, तुम्ही पूर्ण केलेल्या गोष्टीचा नोंदवही, तुमच्या सोडविलेल्या समस्या एका ठिकाणी, आणि या पानाच्या विषयी तुम्ही विचारू शकता अशा शिक्षकाला. गणित स्वतःच सर्वांसाठी खुले आहे, दाखलन झालेले असो किंवा नसो.
नोंदणी करा दाखलनयेथे वापरलेले चिन्ह
Tap any symbol for the full definition, a picture, and what every letter in it means.
कसे कराल: Floating point and error
- Add: 0.1 + 0.2 = 3/10.
- Simplify.
लोक विचारतात ते प्रश्न
Why not just solve exactly?
Most equations have no closed-form solution at all, and many that do are unusable in practice. A numerical method delivers as many correct digits as you need, and a good one tells you how many that is.
Why can Newton's method fail?
If it starts where the tangent is nearly flat it shoots far away; near a repeated root it slows to a crawl; and with several roots it may land on the wrong one. A bracketing method like bisection is slower but cannot fail.
अधिक माहिती Numerical Methods
Root finding: bisection and Newton's methodNumerical integration: trapezoid and SimpsonInterpolation and Taylor approximation