Date of Award:
5-1967
Document Type:
Thesis
Degree Name:
Master of Science (MS)
Department:
Computer Science
Department name when degree awarded
Computer Science - Applied Statistics
Committee Chair(s)
Wendell L. Pope
Committee
Wendell L. Pope
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.
Checksum
64af765e51c530afede4596d4f469b7a
Recommended Citation
Peterson, Jay Roland, "Rational Arithmetic as a Means of Matrix Inversion" (1967). All Graduate Theses and Dissertations, Spring 1920 to Summer 2023. 6815.
https://digitalcommons.usu.edu/etd/6815
Copyright for this work is retained by the student. If you have any questions regarding the inclusion of this work in the Digital Commons, please email us at .