Thumbnail
Access Restriction
Subscribed

Author Tsao, Nai-kuan
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1974
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Efficiently computable a posteriori error bounds are attained by using a posteriori models for bounding roundoff errors in the basic floating-point operations. Forward error bounds are found for inner product and polynomial evaluations. An analysis of the Crout algorithm in solving systems of linear algebraic equations leads to sharper backward a posteriori bounds. The results in the analysis of the iterative refinement give bounds useful in estimating the rate of convergence. Some numerical experiments are included.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1974-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 21
Issue Number 1
Page Count 12
Starting Page 6
Ending Page 17


Open content in new tab

   Open content in new tab
Source: ACM Digital Library