Back to search

University of Alabama Birmingham

Analysis of Systems of First Order Linear Differential Equations with Non-Diagonalizable Matrices

Abstract

dc:description.abstract

Finding solutions to differential equations is notoriously computationally intensive given that the number of operations required is heavily dependent on the algorithm being implemented. This is especially true for systems described by a matrix representation because as the eigenvalues of the system approach non-uniqueness, any approximations made by the program looking for the solution can lead to undesirable precision errors when calculating the final solution. In this document, two algorithms are compared which deal with this issue of stability which can greatly affect the decision to use one method over the other. In the method of solving the system by means of matrix diagonalization can be easily found given distinct eigenvalues; however, problems come up as the eigenvalues of the system converge as this leads to undefined entries in the inverse eigenvector matrix. The Putzer algorithm, however, sidesteps these singularities, resulting in a method that produces approximations independent of the angle between the eigenvectors of the system.

Degree

thesis:*
Level thesis:degree_level
Thesis

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Plowman, Nicholas Claude
Contributors dc:contributor
  • Roman Shterenberg
  • Nikita Selinger
  • Nandor J Simanyi

Subjects

dc:subject × 1

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
University of Alabama Birmingham
Base URL
digitalcommons.library.uab.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Plowman, Nicholas Claude. Analysis of Systems of First Order Linear Differential Equations with Non-Diagonalizable Matrices. Thesis thesis, https://digitalcommons.library.uab.edu/etd-collection/138