This project studies existence, uniqueness and methods for calculating a smoothly varying singular value decomposition of a smooth matrix valued function. The smooth singular value decomposition has applications in differential algebraic equations including time dependent optimal control problems for descriptor systems. Preliminary work with real analytic functions is to be extended to a larger class of smooth functions and more efficient numerical methods for tracking all of or part of a smoothly varying singular value decomposition are being investigated. This project is also developing numerical methods for calculating the controllability radius, regularity radius, and other distances of interest in computational control. It is developing efficient, provably reliable, numerically stable methods. Success here will generalize to a means of estimating the distance from a generic matrix pencil to an algebraic variety of nongeneric pencils and to general condition estimators.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
9404425
Program Officer
S. Kamal Abdali
Project Start
Project End
Budget Start
1995-05-15
Budget End
1999-04-30
Support Year
Fiscal Year
1994
Total Cost
$116,921
Indirect Cost
Name
University of Kansas Main Campus
Department
Type
DUNS #
City
Lawrence
State
KS
Country
United States
Zip Code
66045