Abstract
dc:description.abstractOf the six or so eigenvalue assignment algorithms currently available, several have been claimed to be numerically stable. To date only one has a published proof of numerical stability. This paper examines the eigenvalue assignment algorithm proposed by Petkov, Christov, and Konstantinov. Moss and Cox have proven this algorithm to be numerically stable by performing a backward error analysis. A FORTRAN implementation of the algorithm is included.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Mathematical Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Owens, Jeffrey Mark
- Contributors dc:contributor
-
- W. F. Moss
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/arv_theses/130