Methods of controlling round-off error in one-step methods in the numerical solution of ordinary differential equations are compared. A new Algorithm called theoretical cumulative rounding is formulated. Round-off error bounds are obtained for single precision, and theoretical cumulative rounding. Limits of these bounds are obtained as the step length approaches zero. It is shown that the limit of the bound on the round-off error is unbounded for single precision and double precision, is constant for theoretical partial double precision, and is zero for theoretical cumulative rounding.
The limits of round-off bounds are not obtainable in actual practice. The round-off error increases for single precision, remains about constant for partial double precision and decreases for cumulative rounding as the step length decreases. Several examples are included. (34 pages)
| Identifer | oai:union.ndltd.org:UTAHS/oai:digitalcommons.usu.edu:etd-7882 |
| Date | 01 May 1968 |
| Creators | Rasmuson, Dale M. |
| Publisher | DigitalCommons@USU |
| Source Sets | Utah State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | All Graduate Theses and Dissertations |
| Rights | Copyright for this work is held by the author. Transmission or reproduction of materials protected by copyright beyond that allowed by fair use requires the written permission of the copyright owners. Works not in the public domain cannot be commercially exploited without permission of the copyright owner. Responsibility for any use rests exclusively with the user. For more information contact digitalcommons@usu.edu. |
Page generated in 0.0024 seconds