Diophantine linear system solving: Difference between revisions
Content deleted Content added
New task and FreeBasic solution. |
mNo edit summary |
||
Line 16:
How is this task different from [[Gaussian_elimination| Gaussian elimination]]?
We now need a triangularization method that doesn't introduce fractions.
The LLLHnf algorithm adapts Lenstra-Lenstra-Lovász
to put the transpose of the input system into Hermite normal form,
the integer analogue of the usual [[Reduced_row_echelon_form| reduced row echelon form]].
Line 191:
0 0 0 0 -1 1 1 0
0 0 0 0 0 -1 -1 0
'Hnf(A) with Aij = i^
10
10
Line 435:
'Hnf(A) with Aij = i^
P | Hnf
-10 -8 -5 1 2 3 5 3 0 -4 0 | 1 0 7 22 45 76 115 162 217 280 0
| |||