{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-7882"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-7882","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"Tests of Methods that Control Round-Off Error","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Rasmuson, Dale M."],"institution":"Hosted by Utah State University Libraries","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["Richard A. Hansen","James D. Watson"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:50:15Z","subjects":["round-off error limits","partial cumulative rounding","limits","Applied Mathematics","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/2030-3797"],"render_values":[{"text":"https://doi.org/10.26076/2030-3797","href":"https://doi.org/10.26076/2030-3797","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/6817","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/6817","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usu.edu%3Aetd-7882","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Richard A. Hansen","James D. Watson"]},{"key":"dc:creator","label":"Author","values":["Rasmuson, Dale M."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2010-01-01T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["1968-05-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["round-off error limits","partial cumulative rounding","limits","Applied Mathematics","Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/6817"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/2030-3797"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Tests of Methods that Control Round-Off Error"]}]}],"canonical_facts":{"dc:contributor":["Richard A. Hansen","James D. Watson"],"dc:creator":["Rasmuson, Dale M."],"dc:date.available":["2010-01-01T08:00:00Z"],"dc:date.created":["1968-05-01T07:00:00Z"],"dc:description.abstract":["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."],"dc:identifier":["https://digitalcommons.usu.edu/etd/6817"],"dc:identifier.doi":["https://doi.org/10.26076/2030-3797"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["round-off error limits","partial cumulative rounding","limits","Applied Mathematics","Mathematics"],"dc:title":["Tests of Methods that Control Round-Off Error"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T08:50:15Z"}