Differentiation of Kaltofen's division-free determinant algorithm - ENS de Lyon - École normale supérieure de Lyon Access content directly
Journal Articles Journal of Symbolic Computation Year : 2011

Differentiation of Kaltofen's division-free determinant algorithm


Kaltofen has proposed a new approach in [Kaltofen 1992] for computing matrix determinants. 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 field and by the results of Baur and Strassen 1983, the determinant algorithm, actually a straight-line program, leads to an algorithm with the same complexity for computing the adjoint of a matrix [Kaltofen 1992]. However, the latter is obtained by the reverse mode of automatic differentiation and somehow is not ``explicit''. We study this adjoint algorithm, show how it can be implemented (without resorting to an automatic transformation), and demonstrate its use on polynomial matrices.
Fichier principal
Vignette du fichier
diff.pdf (116.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

ensl-00270753 , version 1 (07-04-2008)



Gilles Villard. Differentiation of Kaltofen's division-free determinant algorithm. Journal of Symbolic Computation, 2011, 46 (7), pp.773-790. ⟨10.1016/j.jsc.2010.08.012⟩. ⟨ensl-00270753⟩
114 View
149 Download



Gmail Facebook Twitter LinkedIn More