rcorless@uwovax.uwo.ca (10/28/90)
Recently some questions have been asked in sci.math.num-analysis about the algorithms used in the HP series for numerical integration. The reference to Kahan's article in the 1980 HP Journal was given (it is an excellent article). I know there is a similar article discussing the algorithms used for rootfinding (I've seen it, I don't know if I actually have it still). I have some questions about any other articles. Is there an article describing the changes made to the integration algorithm since the 34C? I know the 28S behaves better in some cases, so the algorithm must be slightly different. Were there any changes to the algorithm for the 48, aside from syntax changes for entry? Are there articles discussing the algorithms used for solution of linear systems? For evaluation of the various functions? Algebraic simplification? It would be nice to have all of these collected in a single book, actually - I bet I am not the only one interested in just how these wonderful keys carry out their business. Our library does not carry the HP Journal - perhaps it should if it turns out to be the source for all the requested material. -- ======== Robert Corless, Applied Mathematics, University of Western Ontario ======== London, Ontario, Canada N6A 5B9 e-mail : RCORLESS@uwovax.uwo.ca