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.

Esempio svolto · 0.1 + 0.2

Arithmetic · Arithmetic

Evaluate 0.1 + 0.2

0.1 + 0.2

Passo dopo passo

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

    Add: 0.1 + 0.2 = 3/10.

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

    Simplify.

Rivela la risposta
0.3

Ora tu Scegli un problema, o digitare o disegnare il proprio. Ogni passo, un'immagine, la risposta nascosta fino a quando non si chiede.

Conserva il tuo lavoro

Un account gratuito aggiunge note su ogni lezione, un record di ciò che hai finito, i tuoi problemi risolti in un unico luogo, e un tutor che puoi chiedere su questa pagina. La matematica stessa è aperta a tutti, firmato o no.

Iscriviti Accesso

Simboli utilizzati qui

Toccare qualsiasi simbolo per la definizione completa, un'immagine, e che cosa ogni lettera in esso significa.

Come: Floating point and error

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

Domande che la gente chiede

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.

Altro in Numerical Methods

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