Author

Date of Award

Degree Name

Department

First Advisor

Second Advisor

Third Advisor

Dr. J. Donald Nelson

Access Setting

Masters Thesis-Open Access

Abstract

This is an investigation of the use of some techniques from numerical linear algebra in solving linear recurrence relations.

The classic methods of Oliver and Lozier are compared with several alternatives. These alternatives center on using advances in the theory of numerical linear algebra, computer software, and raw computer performance which have been made in the 15 years since the original research into linear recurrence relations was done.

A set of test examples is presented to provide a basis to compare solution methods. This set of examples was selected to allow experiments associated with the Poincare class of recurrence relations.

A flexible software system was assembled, which includes access to LINPACK routines, some with extensions, to provide an environment for quick implementation and comparison of solution methods.