Date of Award
Master of Science (MS)
Committee Chair Department
Given a matrix of integers, we wish to compute the determinant using a method that does not introduce fractions. Fraction-Free Triangularization, Bareiss’ Algorithm (based on Sylvester’s Identity) and Dodgson’s Method (based on Jacobi’s Theorem) are three such methods. However, both Bareiss’ Algorithm and Dodgson’s Method encounter division by zero for some matrices. Although there is a well-known workaround for the Bareiss Algorithm that works for all matrices, the workarounds that have been developed for Dodgson’s method are somewhat difficult to apply and still fail to resolve the problem completely. After investigating new workarounds for Dodgson’s Method, we give a modified version of the old method that relies on a well-known property of determinants to allow us to compute the determinant of any integer matrix.
Copyright for this thesis is owned by the author. It may be freely accessed by all users. However, any reuse or reproduction not covered by the exceptions of the Fair Use or Educational Use clauses of U.S. Copyright Law or without permission of the copyright holder may be a violation of federal law. Contact the administrator if you have additional questions.
Leggett, Deanna Richelle, "Fraction-Free Methods for Determinants" (2011). Master's Theses. 1.