A summation problem

dc.contributor.author	Aik-Koen, Heng
dc.date.accessioned	2018-05-28T15:26:21Z
dc.date.available	2018-05-28T15:26:21Z
dc.date.issued	1986
dc.identifier.citation	Aik-Koen, Heng (1986) A summation problem. Quaestiones Informaticae Vol 4 No 2 1986	en
dc.identifier.issn	0254-2757
dc.identifier.uri	http://hdl.handle.net/10500/24133
dc.description.abstract	This paper suggests a method to minimize the roundoff errors of adding N positive nimbers. The idea of construction can be easily applied to a linear recurrence process.	en
dc.language.iso	en	en
dc.publisher	Computer Society of South Africa (on behalf of SAICSIT)	en
dc.title	A summation problem	en
dc.type	Article	en
dc.description.department	School of Computing	en