Error, Conditioning and Stability
≈ 25 minError, Conditioning and Stability
Conditioning describes problem sensitivity; stability describes how an algorithm propagates errors. A stable algorithm cannot repair an inherently ill-conditioned problem, but it avoids adding unnecessary amplification. The distinction between a formal hypothesis and an intuitive picture is made explicit so that calculations can be justified, not merely patterned.
Worked reasoning
- Conditioning asks how exact output changes under input perturbation.
- It is a property of the problem formulation.
Conditioning is primarily a property of:
Which statement best captures the central mathematical idea in Error, Conditioning and Stability?
When starting a problem about Error, Conditioning and Stability, which move is most reliable?
Which statement is a misconception that must be rejected when working with Error, Conditioning and Stability?

