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.
| Identifer | oai:union.ndltd.org:UTAHS/oai:digitalcommons.usu.edu:etd-7878 |
| Date | 01 May 1967 |
| Creators | Peterson, Jay Roland |
| 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.0018 seconds