	The solution is obtained by Gaussian elimination with partial pivoting, with 2/3n³ + 2n² floating point operations where "n" is 100, the order of the dense matrix "A" that defines the problem. Its small size and the lack of software flexibility doesn't allow most modern computers to reach their performance limits. However, it can still be useful to predict performances in numerically intensive user written code using compiler optimization.