Speaker
Bryan Shader
(University of Wyoming)
Description
This talk discusses problem of determining the minumum number of nonzero entries in a pair of matrices (A,A^(-1)) for A in various families of matrices (e.g. irreducible, fully indecomposable, primitive, positive definite, orthogonal, symmetric with connected graph, irreducible covariance matrices). Some of the results are from work with H. Gupta, L. Hogben and T. Wong.
Author
Bryan Shader
(University of Wyoming)