Diophantine linear system solving: Difference between revisions
Content added Content deleted
(Clarification added) |
|||
| Line 210: | Line 210: | ||
4 |
4 |
||
-1 0041841 0175421 0554985| 7853982 |
-1 0041841 0175421 0554985| 7853982 |
||
'search for polynomial coefficients |
|||
'const sqrt(2) + i |
'const sqrt(2) + i |
||
'set precision and max. degree |
|||
4 |
4 |
||
4 |
4 |
||
| Line 463: | Line 463: | ||
'search for polynomial coefficients |
|||
'const sqrt(2) + i |
'const sqrt(2) + i |
||
'set precision and max. degree |
|||
1.41421356 + 1*i |
1.41421356 + 1*i |
||
P | Hnf |
P | Hnf |
||
| Line 512: | Line 512: | ||
To save server space, better not repeat full test results in your post. |
To save server space, better not repeat full test results in your post. |
||
Once your solution covers all cases, a selected example will suffice. |
Once your solution covers all cases, a selected example will suffice. |
||
;clarification. |
|||
The point of this task is not solving the above puzzles, it is implementing the LLLHnf algorithm. |
|||
You may regard the test set as just random input to validate your solution, no need to delve any deeper. |
|||
But to make the task a little nicer, and of course to demonstrate the power of the algorithm, |
|||
the examples aren't really random.<br/> |
|||
Many are classics, with online resources abound. Others are on Rosetta Code in a different guise; |
|||
some are copied from the HMM paper. Section headers like 'base cases' or 'polynomial coefficients' |
|||
should be self-explanatory.<br/> |
|||
The output is deliberately left somewhat 'raw', so there's plenty of room for implementation |
|||
dependent refinement. Also, to solve this task you're not obliged to click any wiki-links, |
|||
but please do if you want some background information. |
|||