Mahajan, M and Vinay, V (1998) Determinant: Old algorithms, new insights (Extended Abstract). In: 6th Scandinavian Workshop on Algorithm Theory (SWAT 98), JUL 08-10, 1998, Stockholm, Sweden.Full text not available from this repository.
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of the coefficients of the characteristic polynomial, in terms of walks and closed walks of different kinds in the underlying graph. We develop algorithms based on these characterizations, and show that they tally with well-known algorithms arrived at independently from considerations in linear algebra.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer-Verlag Berlin.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||16 Mar 2012 08:38|
|Last Modified:||16 Mar 2012 08:38|
Actions (login required)