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.
ເປີດເຜີຍຄຳຕອບ
ປັດຈຸບັນທ່ານ ເລືອກບັນຫາ ຫຼື ພິມ ຫຼື ແຕ້ມເອງ. ທຸກບາດກ້າວ, ຮູບ, ຄໍາຕອບຖືກລົບຈົນກວ່າເຈົ້າຈະຖາມມັນ.
ຕົວສະແດງທີ່ໃຊ້ຢູ່ທີ່ນີ້
ກົດຕົວອັກສອນໃດໜຶ່ງເພື່ອເບິ່ງຄວາມໝາຍເຕັມ, ຮູບ ແລະ ຕົວອັກສອນແຕ່ລະຕົວໃນມັນໝາຍຄວາມວ່າແນວໃດ.
ວິທີການ: 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