activity
20082025
most citedGPGCD: An iterative method for calculating approximate GCD of univariate polynomials

14 citations · 39 across the 15 of their papers we have counts for

collaborators

15 papers

cs.SC2025

An Exact Algorithm for Computing the Structure of Jordan Blocks

Shinichi Tajima, Katsuyoshi Ohara, Akira Terui

An efficient method is proposed for computing the structure of Jordan blocks of a matrix of integers or rational numbers by exact computation. We have given a method for computing…

cs.RO2023★ 1 cited

Inverse kinematics and path planning of manipulator using real quantifier elimination based on Comprehensive Gröbner Systems

Mizuki Yoshizawa, Akira Terui, Masahiko Mikawa

Methods for inverse kinematics computation and path planning of a three degree-of-freedom (DOF) manipulator using the algorithm for quantifier elimination based on Comprehensive Gr…

cs.SC2023

Computer-assisted proofs of "Kariya's theorem" with computer algebra

Ayane Ito, Takefumi Kasai, Akira Terui

We demonstrate computer-assisted proofs of "Kariya's theorem," a theorem in elementary geometry, with computer algebra. In the proof of geometry theorem with computer algebra, vert…

math.RA2022

Exact Algorithms for Computing Generalized Eigenspaces of Matrices via Jordan-Krylov Basis

Shinichi Tajima, Katsuyoshi Ohara, Akira Terui

An effective exact method is proposed for computing generalized eigenspaces of a matrix of integers or rational numbers. Keys of our approach are the use of minimal annihilating po…

math.AC2022★ 1 cited

The GPGCD Algorithm with the Bézout Matrix for Multiple Univariate Polynomials

Boming Chi, Akira Terui

We propose a modification of the GPGCD algorithm, which has been presented in our previous research, for calculating approximate greatest common divisor (GCD) of more than 2 univar…

cs.RO2021★ 3 cited

A Design and an Implementation of an Inverse Kinematics Computation in Robotics Using Real Quantifier Elimination based on Comprehensive Gröbner Systems

Shuto Otaki, Akira Terui, Masahiko Mikawa

The solution and implementation of the inverse kinematics computation of a three degree-of-freedom (DOF) robot manipulator using an algorithm for real quantifier elimination with C…

math.NA2020★ 2 cited

Solving System of Nonlinear Equations with the Genetic Algorithm and Newton's Method

Ryuji Koshikawa, Akira Terui, Masahiko Mikawa

An implementation and an application of the combination of the genetic algorithm and Newton's method for solving a system of nonlinear equations is presented. The method first uses…

math.NA2018

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…

math.AC2018★ 1 cited

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…

math.AC2012★ 14 cited

GPGCD: An iterative method for calculating approximate GCD of univariate polynomials

Akira Terui

We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real or the complex coefficients. For a given pair of…

math.AC2010★ 1 cited

GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials

Akira Terui

We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs.…

math.AC2010★ 3 cited

GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients

Akira Terui

We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to polynomials with the comple…

math.AC2008★ 9 cited

Recursive Polynomial Remainder Sequence and its Subresultants

Akira Terui

We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," along with investigation of their properties. A recursive PRS is defined as,…

math.AC2008★ 1 cited

Recursive Polynomial Remainder Sequence and the Nested Subresultants

Akira Terui

We give two new expressions of subresultants, nested subresultant and reduced nested subresultant, for the recursive polynomial remainder sequence (PRS) which has been introduced b…

math.AC2008★ 3 cited

Subresultants in Recursive Polynomial Remainder Sequence

Akira Terui

We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," and investigate their properties. In calculating PRS, if there exists the GCD…