We use Q-matrices to efficiently solve incremental linear systems over IR, using integer computations. An algorithm optimized for the Q-pivot operation of Q-matrices is described, allowing a noticeable improvement in the efficiency of linear constraint solvers with infinite precision. We then present a coding of Q-matrices suitable for this algorithm and give some performance measurements.