{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-7878"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-7878","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"Rational Arithmetic as a Means of Matrix Inversion","abstract":"The solution to a set of simultaneous equations is of the form A-1 B = X where A-1 is the inverse of A in the equation AX= B. The purpose of this study is to obtain an exact A-1 through the use of rational arithmetic, and to study the behavior of rational numbers when used in arithmetic calculations. This study describes a matrix inversion program written in SPS II, utilizing the concept of rational arithmetic. This program, using the Gaussian elimination matrix inversion method, is compared to the same method written in Fortran. Gaussian elimination was used by this study because of its simplicity and speed of inversion. The Adjoint method was ruled out because of its complexity and relative lack of speed when compared with Gaussian elimination. The Fortran program gives only an approximate inverse due to the rounding error while the rational arithmetic program gives an exact inverse.","abstract_html":"The solution to a set of simultaneous equations is of the form A-1 B = X where A-1 is the inverse of A in the equation AX= B. The purpose of this study is to obtain an exact A-1 through the use of rational arithmetic, and to study the behavior of rational numbers when used in arithmetic calculations. This study describes a matrix inversion program written in SPS II, utilizing the concept of rational arithmetic. This program, using the Gaussian elimination matrix inversion method, is compared to the same method written in Fortran. Gaussian elimination was used by this study because of its simplicity and speed of inversion. The Adjoint method was ruled out because of its complexity and relative lack of speed when compared with Gaussian elimination. The Fortran program gives only an approximate inverse due to the rounding error while the rational arithmetic program gives an exact inverse.","abstract_has_math":false,"creators":["Peterson, Jay Roland"],"institution":"Hosted by Utah State University Libraries","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Wendell L. Pope"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:50:15Z","subjects":["matrix inversion","rational arithmetic","fortran matrix inversion","Computer Sciences","Statistics and Probability"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/07f2-2604"],"render_values":[{"text":"https://doi.org/10.26076/07f2-2604","href":"https://doi.org/10.26076/07f2-2604","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/6815","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/6815","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-7878","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Wendell L. Pope"]},{"key":"dc:creator","label":"Author","values":["Peterson, Jay Roland"]}]},{"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":["1967-05-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"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":["matrix inversion","rational arithmetic","fortran matrix inversion","Computer Sciences","Statistics and Probability"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/6815"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/07f2-2604"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The solution to a set of simultaneous equations is of the form A-1 B = X where A-1 is the inverse of A in the equation AX= B. The purpose of this study is to obtain an exact A-1 through the use of rational arithmetic, and to study the behavior of rational numbers when used in arithmetic calculations. This study describes a matrix inversion program written in SPS II, utilizing the concept of rational arithmetic. This program, using the Gaussian elimination matrix inversion method, is compared to the same method written in Fortran. Gaussian elimination was used by this study because of its simplicity and speed of inversion. The Adjoint method was ruled out because of its complexity and relative lack of speed when compared with Gaussian elimination. The Fortran program gives only an approximate inverse due to the rounding error while the rational arithmetic program gives an exact inverse."]},{"key":"dc:title","label":"Title","values":["Rational Arithmetic as a Means of Matrix Inversion"]}]}],"canonical_facts":{"dc:contributor":["Wendell L. Pope"],"dc:creator":["Peterson, Jay Roland"],"dc:date.available":["2010-01-01T08:00:00Z"],"dc:date.created":["1967-05-01T07:00:00Z"],"dc:description.abstract":["The solution to a set of simultaneous equations is of the form A-1 B = X where A-1 is the inverse of A in the equation AX= B. The purpose of this study is to obtain an exact A-1 through the use of rational arithmetic, and to study the behavior of rational numbers when used in arithmetic calculations. This study describes a matrix inversion program written in SPS II, utilizing the concept of rational arithmetic. This program, using the Gaussian elimination matrix inversion method, is compared to the same method written in Fortran. Gaussian elimination was used by this study because of its simplicity and speed of inversion. The Adjoint method was ruled out because of its complexity and relative lack of speed when compared with Gaussian elimination. The Fortran program gives only an approximate inverse due to the rounding error while the rational arithmetic program gives an exact inverse."],"dc:identifier":["https://digitalcommons.usu.edu/etd/6815"],"dc:identifier.doi":["https://doi.org/10.26076/07f2-2604"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["matrix inversion","rational arithmetic","fortran matrix inversion","Computer Sciences","Statistics and Probability"],"dc:title":["Rational Arithmetic as a Means of Matrix Inversion"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T08:50:15Z"}