Numerical Stability — Worked Example

Direct answer

Numerical Stability — Worked Example is limited to the bound authority, implementation, or commercial acquisition state and carries its exclusions explicitly.

Answer contract

Apply the worked example lens only to the exact inspected source scope; do not infer authority from adjacent topics.

Evidence and exact locators

t21-cancellation — lib/federation/readiness-tranche-21.ts — cancellationFixture. Supports: Compares one specified IEEE-754 binary64 cancellation result with exact integer arithmetic.

src-nist-stability — Discussion of stability and conditioning. Supports: Distinguishes an ill-conditioned problem from an unstable algorithm and bounds stability by comparison with inherent error.

What the evidence does not establish

One cancellation example does not characterize an algorithm, platform beyond ECMAScript Number semantics, or general stability.

Does not establish the stability of a named algorithm without an analysis under its stated inputs and arithmetic.

Rights and reuse

project-owned-reference-only

reference-only

Dependencies and related concepts

applies-to: urn:maha:concept:computation:numerical-stability

governed-by: urn:maha:concept:governance

evidence-for: urn:maha:concept:computation

Authority or implementation

This authority or implementation section is constrained to the same inspected scope: Compares one specified IEEE-754 binary64 cancellation result with exact integer arithmetic. Distinguishes an ill-conditioned problem from an unstable algorithm and bounds stability by comparison with inherent error.

It must preserve the recorded boundary: One cancellation example does not characterize an algorithm, platform beyond ECMAScript Number semantics, or general stability. Does not establish the stability of a named algorithm without an analysis under its stated inputs and arithmetic.

Mechanism or acquisition state

This mechanism or acquisition state section is constrained to the same inspected scope: Compares one specified IEEE-754 binary64 cancellation result with exact integer arithmetic. Distinguishes an ill-conditioned problem from an unstable algorithm and bounds stability by comparison with inherent error.

It must preserve the recorded boundary: One cancellation example does not characterize an algorithm, platform beyond ECMAScript Number semantics, or general stability. Does not establish the stability of a named algorithm without an analysis under its stated inputs and arithmetic.

Verification and uncertainty

This verification and uncertainty section is constrained to the same inspected scope: Compares one specified IEEE-754 binary64 cancellation result with exact integer arithmetic. Distinguishes an ill-conditioned problem from an unstable algorithm and bounds stability by comparison with inherent error.

It must preserve the recorded boundary: One cancellation example does not characterize an algorithm, platform beyond ECMAScript Number semantics, or general stability. Does not establish the stability of a named algorithm without an analysis under its stated inputs and arithmetic.

What this does not establish

This what this does not establish section is constrained to the same inspected scope: Compares one specified IEEE-754 binary64 cancellation result with exact integer arithmetic. Distinguishes an ill-conditioned problem from an unstable algorithm and bounds stability by comparison with inherent error.

It must preserve the recorded boundary: One cancellation example does not characterize an algorithm, platform beyond ECMAScript Number semantics, or general stability. Does not establish the stability of a named algorithm without an analysis under its stated inputs and arithmetic.

Questions this page can answer