activity
20102025
most citedGPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients

3 citations · 4 across the 5 of their papers we have counts for

collaborators

5 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.RO20251 cited

An Effective Trajectory Planning and an Optimized Path Planning for a 6-Degree-of-Freedom Robot Manipulator

Takumu Okazaki, Akira Terui, Masahiko Mikawa

An effective method for optimizing path planning for a specific model of a 6-degree-of-freedom (6-DOF) robot manipulator is presented as part of the motion planning of the manipula…

cs.RO2025

Inverse Kinematics for a 6-Degree-of-Freedom Robot Manipulator Using Comprehensive Gröbner Systems

Takumu Okazaki, Akira Terui, Masahiko Mikawa

We propose an effective method for solving the inverse kinematic problem of a specific model of 6-degree-of-freedom (6-DOF) robot manipulator using computer algebra. It is known th…

cs.RO2024

An Optimized Path Planning of Manipulator Using Spline Curves and Real Quantifier Elimination Based on Comprehensive Gröbner Systems

Yusuke Shirato, Natsumi Oka, Akira Terui +1

This paper presents an advanced method for addressing the inverse kinematics and optimal path planning challenges in robot manipulators. The inverse kinematics problem involves det…

math.AC20103 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…