2 citations · 6 across the 9 of their papers we have counts for
9 papers
Methods for computing -functions associated with -constant deformations -- Case of inner modality 2 --
Katsusuke Nabeshima, Shinichi Tajima
New methods for computing parametric local -functions are introduced for -constant deformations of semi-weighted homogeneous singularities. The keys of the methods are compre…
An effective method for computing Grothendieck point residue mappings
Shinichi Tajima, Katsusuke Nabeshima
Grothendieck point residue is considered in the context of computational complex analysis. A new effective method is proposed for computing Grothendieck point residues mappings and…
Computing Regular Meromorphic Differential Forms via Saito's Logarithmic Residues
Shinichi Tajima, Katsusuke Nabeshima
Logarithmic differential forms and logarithmic vector fields associated to a hypersurface with an isolated singularity are considered in the context of computational complex analys…
Testing zero-dimensionality of varieties at a point
Katsusuke Nabeshima, Shinichi Tajima
Effective methods are introduced for testing zero-dimensionality of varieties at a point. The motivation of this paper is to compute and analyze deformations of isolated hypersurfa…
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…
An algorithm for computing the Hilbert--Samuel multiplicities and reductions of zero-dimensional ideals of Cohen--Macaulay local rings
Takafumi Shibuta, Shinichi Tajima
In this paper, we present an algorithm for computing the minimal reductions of -primary ideals of Cohen--Macaulay local rings. Using this algorithm, we are able to co…
Algebraic Local Cohomology with Parameters and Parametric Standard Bases for Zero-Dimensional Ideals
Katsusuke Nabeshima, Shinichi Tajima
A computation method of algebraic local cohomology with parameters, associated with zero-dimensional ideal with parameter, is introduced. This computation method gives us in partic…