Talk:Kahan summation: Difference between revisions
Content added Content deleted
(Another note to the task) |
(→Task 2: Why just one representation?) |
||
| Line 97: | Line 97: | ||
==Task 2== |
==Task 2== |
||
I suggest to rewrite this task from scratch, giving in the task description 7 or 10 64 bit floating point numbers (or more if generated with a portable random generator), and show the results with a basic summation algorithm versus doing it with Kahan. And show in some ways that the second loses less precision. Nothing more. -[[User:Bearophile|bearophile]] ([[User talk:Bearophile|talk]]) 10:34, 20 December 2014 (UTC) |
I suggest to rewrite this task from scratch, giving in the task description 7 or 10 64 bit floating point numbers (or more if generated with a portable random generator), and show the results with a basic summation algorithm versus doing it with Kahan. And show in some ways that the second loses less precision. Nothing more. -[[User:Bearophile|bearophile]] ([[User talk:Bearophile|talk]]) 10:34, 20 December 2014 (UTC) |
||
:But what about the issues we have already uncovered in several languages? What about languages that have much better control of number representation and calculations? There is a chance for languages that have these extra capabilities to shine and I would not want to lose that by fixing on one representation. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 16:03, 20 December 2014 (UTC) |
|||