Abstract
The paper gives a historical survey of roundoff error analysis starting with a reappraisal of the classical paper by von Neumann and Goldstine; it is shown that their results compare less unfavorably with recent error analyses than is generally supposed. The conscious adoption of backward error analysis and floating-point computation has greatly simplified error analysis and exposed the importance of the control of “growth” in matrix computations based on equivalence and similarity transformations. This has led to the use of unitary transformations with guaranteed numerical stability.
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.
