Factor an unchanged square matrix for repeated right-hand sides using
partial-pivot Gaussian elimination. Inputs must be finite, square and
consistently scaled with representable intermediate arithmetic. A pivot
no greater than 1e-14 times the largest original entry returns null, the
existing dense solver's rejection rule rather than a rank certificate.
The returned solver replays the same row swaps and elimination factors on
each copied right-hand side, then performs back substitution in descending
row order. Its arithmetic for every right-hand side is the augmented
Gaussian solve's original arithmetic, including strict pivot ties and
subtraction order. The source matrix may change after preparation because
the factor owns its copied coefficients; prepare again to adopt changes.
Factor an unchanged square matrix for repeated right-hand sides using partial-pivot Gaussian elimination. Inputs must be finite, square and consistently scaled with representable intermediate arithmetic. A pivot no greater than 1e-14 times the largest original entry returns null, the existing dense solver's rejection rule rather than a rank certificate.
The returned solver replays the same row swaps and elimination factors on each copied right-hand side, then performs back substitution in descending row order. Its arithmetic for every right-hand side is the augmented Gaussian solve's original arithmetic, including strict pivot ties and subtraction order. The source matrix may change after preparation because the factor owns its copied coefficients; prepare again to adopt changes.