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.
Ejemplo resuelto · 0.1 + 0.2
Paso a paso
- 0.3 = \frac{3}{10}
Add: 0.1 + 0.2 = 3/10.
- \frac{3}{10} = 0.3
Simplify.
Revelar la respuesta
Ahora tú Escoge un problema, o escribe o dibuja el tuyo. Cada paso, una imagen, la respuesta oculta hasta que preguntes.
Una cuenta gratuita añade notas sobre cada lección, un registro de lo que has terminado, tus problemas resueltos en un lugar, y un tutor que puedes preguntar sobre esta página. Las matemáticas en sí están abiertas a todos, se han registrado o no.
Registrarse Inicio de sesiónSímbolos utilizados aquí
Toque cualquier símbolo para la definición completa, una imagen, y lo que cada letra en ella significa.
Cómo: Floating point and error
- Add: 0.1 + 0.2 = 3/10.
- Simplify.
Preguntas que la gente hace
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.
Más en Numerical Methods
Root finding: bisection and Newton's methodNumerical integration: trapezoid and SimpsonInterpolation and Taylor approximation