3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.SC2004★ 3 cited
Jordan Normal and Rational Normal Form Algorithms
Bernard Parisse, Morgane Vaughan
In this paper, we present a determinist Jordan normal form algorithms based on the Fadeev formula: \[(λ\cdot I-A) \cdot B(λ)=P(λ) \cdot I\] where is 's comatri…
cs.SC2002
A correct proof of the heuristic GCD algorithm
Bernard Parisse
In this note, we fill a gap in the proof of the heuristic GCD in the multivariate case made by Char, Geddes and Gonnet (JSC 1989) and give some additionnal information on this meth…