Abstract
An n × n real matrix is said to be totally positive if every minor is nonnegative. In this paper, we are interested in totally positive completion problems, that is, when a partial totally positive matrix has a totally positive matrix completion. This problem has, in general, a negative answer when the graph of the specified entries of the partial matrix is a path or a cycle. For these cases, we obtain necessary and sufficient conditions in order to obtain the desired completion.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this paper
Cite this paper
Jordán, C., Torregrosa, J.R. Paths and Cycles in the Totally Positive Completion Problem. In: Benvenuti, L., De Santis, A., Farina, L. (eds) Positive Systems. Lecture Notes in Control and Information Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44928-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-44928-7_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40342-5
Online ISBN: 978-3-540-44928-7
eBook Packages: Springer Book Archive