View Proposal #362
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
| ID | 362 |
|---|---|
| First Name | Craig |
| Last Name | Erickson |
| Institution | Iowa State University |
| Speaker Category | graduate student |
| Title of Talk | Matrix sign patterns that require eventual exponential nonnegativity |
| Abstract | The matrix exponential function can be used to solve systems of linear differential equations. For certain applications, it is of interest whether or not the matrix exponential function of a given matrix becomes and remains entry-wise nonnegative after some time. Such matrices are called eventually exponentially nonnegative. Often the exact numerical entries in the matrix are not known (for example due to uncertainty in experimental measurements), but the qualitative information is usually known. In this talk we discuss what structure on the signs of the entries of a matrix guarantee the matrix is eventually exponentially nonnegative. |
| Subject area(s) | Combinatorial Matrix Theory |
| Suitable for undergraduates? | Y |
| Day Preference | Either |
| Computer Needed? | N |
| Bringing a laptop? | Y |
| Overhead Needed? | N |
| Software requests | |
| Special Needs | |
| Date Submitted | 09/26/2013 |
| Year | 2013 |