Abstract
After a detailed description of the theoretical foundations of forward error analysis formulated by Stummel, the problem of stability of parallel algorithms, which has as yet received very little attention in the literature, is discussed using arithmetic expressions as an example. The stability analysis includes several summation algorithms, the evaluation of products, parallelization of alternating expressions such as the Horner expression and finite continued fractions and finally general arithmetic expressions. For the CRAY-1 timing versus stability results are given for some of these expressions to classify their numerical quality.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
