Home/ Questions/Q 8112487
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-06T02:31:04+00:00

I am often programming mathematical algorithms that assume a nondimensional parameter spans the continuous

  • 0

I am often programming mathematical algorithms that assume a nondimensional parameter spans the continuous space from 0..1 inclusive. These algorithms could in theory benefit from maximum resolution over the parameter space and I’ve considered that it would be of use to expend the full 32 or 64 bits of precision over the parameter space, with none wasted for exponents or signs.

I imagine the methods would look similar to an unsigned integer divided by its maximum representable value. Does this exist already and if so where, if not, is there a compelling reason why?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Can’t you simply do all calculations in integers from 0 to MAX_INT, keeping all the same formulas/algorithms/whatever and then use “unsigned integer divided by its maximum representable value” conversion as very final step before printing result to user (or otherwise outputting it – for example in intermediate logs)?

    • 0