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.
Ohatra · 0.1 + 0.2
Dingana amin'ny dingana
- 0.3 = \frac{3}{10}
Add: 0.1 + 0.2 = 3/10.
- \frac{3}{10} = 0.3
Simplify.
Asehoy ny valinteny
Ankehitriny ianao Misafidiana olana iray, na soraty na esory ny anao manokana. Ny dingana tsirairay, sary iray, ny valiny miafina mandra-pahafantaranao.
Ny kaonty maimaimpoana dia mampiditra ny fanamarihana amin'ny lesona tsirairay, ny tahirin'ny zavatra vitanao, ny olana voavahao ao amin'ny toerana iray, ary ny mpampianatra iray izay azonao anontanio momba ity pejy ity. misokatra ho an'ny rehetra ny matematika, na efa niditra na tsy niditra.
Misoratra anarana FidiranaMarika ampiasaina eto
Tsindrio ny marika iray mba hahitana ny famaritana feno, sary, ary ny dikan'ny litera tsirairay ao aminy.
Ahoana ny fomba: Floating point and error
- Add: 0.1 + 0.2 = 3/10.
- Simplify.
Fanontaniana napetrak'ireo olona
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.
Mbola maro ao Numerical Methods
Root finding: bisection and Newton's methodNumerical integration: trapezoid and SimpsonInterpolation and Taylor approximation