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.
Contoh yang dikerjakan · 0.1 + 0.2
Langkah demi langkah
- 0.3 = \frac{3}{10}
Add: 0.1 + 0.2 = 3/10.
- \frac{3}{10} = 0.3
Simplify.
Tunjukkan jawapan
Sekarang kau Pilih masalah, atau taip atau lukis sendiri. Setiap langkah, gambar, jawapan tersembunyi sehingga anda tanya.
Akaun percuma menambah nota pada setiap pengajaran, rekod apa yang anda selesaikan, masalah yang anda selesaikan di satu tempat, dan seorang guru yang anda boleh tanya tentang halaman ini. Matematik itu sendiri terbuka kepada semua orang, sama ada anda log masuk atau tidak.
Daftar Masuk Log masukSimbol yang digunakan di sini
Tekan simbol mana-mana untuk definisi penuh, gambar, dan apa makna setiap huruf dalamnya.
Bagaimana untuk: Floating point and error
- Add: 0.1 + 0.2 = 3/10.
- Simplify.
Soalan yang orang tanya
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.
Lebih dalam Numerical Methods
Root finding: bisection and Newton's methodNumerical integration: trapezoid and SimpsonInterpolation and Taylor approximation