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.

Urugero · 0.1 + 0.2

Arithmetic · Arithmetic

Evaluate 0.1 + 0.2

0.1 + 0.2

ku

  1. 0.3 = \frac{3}{10}

    Add: 0.1 + 0.2 = 3/10.

  2. \frac{3}{10} = 0.3

    Simplify.

i
0.3

Guhitamo A, Cyangwa Ubwoko: Cyangwa Gushushanya. Intera, A Ishusho, i Gihishwe & Kugeza & Kubaza.

Kuri Gushyiraho

A Kigenga Konti: & OYA & Ongera Ibisobanuro: ku, A Ibijyana Bya, in Rimwe, na A Kubaza Bigyanye iyi Ipaji:. Imibare ni Gufungura Kuri, in Cyangwa OYA.

Kwiyandikisha Ifashayinjira

Byakoreshejwe

Icyo ari cyo cyose Ibimenyetso ya: i Byuzuye Insobanuro:, A Ishusho, na buri Ibaruwa: in.

Kuri: Floating point and error

  1. Add: 0.1 + 0.2 = 3/10.
  2. Simplify.

Abaturage

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.

in Numerical Methods

Root finding: bisection and Newton's methodNumerical integration: trapezoid and SimpsonInterpolation and Taylor approximation