Floating-Point Numbers and Stable Computation
Use runnable examples of binary representation, rounding, cancellation and summation to understand conditioning, backward stability and justified tolerances.
Use runnable examples of binary representation, rounding, cancellation and summation to understand conditioning, backward stability and justified tolerances.
A foundation map for approximation, error, stability, and reliable computation with finite precision.
Compare Euler, RK4, implicit and symplectic integration with runnable decay and oscillator examples, and check step size, error and long-term energy behavior.