Computer Science – Symbolic Computation
Scientific paper
2008-10-31
Computer Science
Symbolic Computation
Scientific paper
Kaltofen has proposed a new approach in 1992 for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Krylov subspaces, and computes the determinant as the constant term of a characteristic polynomial. For matrices over an abstract ring, by the results of Baur and Strassen, the determinant algorithm, actually a straight-line program, leads to an algorithm with the same complexity for computing the adjoint of a matrix. However, the latter adjoint algorithm is obtained by the reverse mode of automatic differentiation, hence somehow is not "explicit". We present an alternative (still closely related) algorithm for the adjoint thatcan be implemented directly, we mean without resorting to an automatic transformation. The algorithm is deduced by applying program differentiation techniques "by hand" to Kaltofen's method, and is completely decribed. As subproblem, we study the differentiation of programs that compute minimum polynomials of lineraly generated sequences, and we use a lazy polynomial evaluation mechanism for reducing the cost of Strassen's avoidance of divisions in our case.
No associations
LandOfFree
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-456826