2 citations · 6 across the 9 of their papers we have counts for
3 papers · 1 filter
An algorithm for computing Grothendieck local residues II --- general case ---
Katsuyoshi Ohara, Shinichi Tajima
Grothendieck local residue is considered in the context of symbolic computation. Based on the theory of holonomic D-modules, an effective method is proposed for computing Grothendi…
Fast Algorithms for Computing Eigenvectors of Matrices via Pseudo Annihilating Polynomials
Shinichi Tajima, Katsuyoshi Ohara, Akira Terui
An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials i…
Fast Algorithm for Calculating the Minimal Annihilating Polynomials of Matrices via Pseudo Annihilating Polynomials
Shinichi Tajima, Katsuyoshi Ohara, Akira Terui
Minimal annihilating polynomials are very useful in a wide variety of algorithms in exact linear algebra. A new efficient method is proposed for calculating the minimal annihilatin…