抄録
We show another formulation for computing RUR (Rational Univariate Representation) solutions to systems of algebraic equations. This algorithm is based on the symbolic computation of the eigenproblem method to polynomial systems. The clue to a practical implementation is the speedup of Frobenius normal forms computation by modular methods. The result of computational experiment is shown and the practicality of the algorithms is discussed.
