| Publication | Date of Publication | Type |
|---|
| Inverse kinematics for a 6-degree-of-freedom robot manipulator using comprehensive Gröbner systems | 2026-02-27 | Paper |
| An effective trajectory planning and an optimized path planning for a 6-degree-of-freedom robot manipulator | 2026-02-27 | Paper |
| Inverse kinematics and path planning of manipulator using real quantifier elimination based on Comprehensive Gr\"obner Systems | 2023-05-21 | Paper |
| Computer-assisted proofs of "Kariya's theorem" with computer algebra | 2023-04-15 | Paper |
The GPGCD algorithm with the Bézout matrix
ACM Communications in Computer Algebra | 2023-01-11 | Paper |
| The GPGCD algorithm with the Bézout matrix | 2022-12-21 | Paper |
A design and an implementation of an inverse kinematics computation in robotics using Gröbner bases
Lecture Notes in Computer Science | 2022-10-13 | Paper |
| Exact Algorithms for Computing Generalized Eigenspaces of Matrices via Annihilating Polynomials | 2022-09-11 | Paper |
| The GPGCD Algorithm with the B\'ezout Matrix for Multiple Univariate Polynomials | 2022-05-05 | Paper |
| A Design and an Implementation of an Inverse Kinematics Computation in Robotics Using Real Quantifier Elimination based on Comprehensive Gr\"obner Systems | 2021-10-30 | Paper |
| Solving System of Nonlinear Equations with the Genetic Algorithm and Newton's Method | 2020-07-10 | Paper |
| Test polynomials for approximate GCD algorithms | 2019-04-05 | Dataset |
| Fast Algorithms for Computing Eigenvectors of Matrices via Pseudo Annihilating Polynomials | 2018-11-22 | Paper |
| Fast Algorithm for Calculating the Minimal Annihilating Polynomials of Matrices via Pseudo Annihilating Polynomials | 2018-01-25 | Paper |
Computing clustered close-roots of univariate polynomials
Proceedings of the 2009 conference on Symbolic numeric computation | 2017-02-03 | Paper |
GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials
ACM Communications in Computer Algebra | 2015-02-20 | Paper |
An extension and efficient calculation of the Horner's rule for matrices
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
Developing linear algebra packages on Risa/Asir for eigenproblems
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
Theoretical Computer Science | 2013-11-29 | Paper |
An iterative method for calculating approximate GCD of univariate polynomials
Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials
Lecture Notes in Computer Science | 2010-09-10 | Paper |
GPGCD, an iterative method for calculating approximate GCD of univariate polynomials, with the complex coefficients
(available as arXiv preprint) | 2010-03-10 | Paper |
Words, tilings and combinatorial spectra
Hiroshima Mathematical Journal | 2009-06-30 | Paper |
Recursive polynomial remainder sequence and its subresultants
Journal of Algebra | 2008-10-06 | Paper |
| Subresultants in Recursive Polynomial Remainder Sequence | 2008-06-03 | Paper |
Computer Algebra in Scientific Computing
Lecture Notes in Computer Science | 2006-07-07 | Paper |
A formula for separating small roots of a polynomial
ACM SIGSAM Bulletin | 2004-09-01 | Paper |
Durand-Kerner method for the real roots
Japan Journal of Industrial and Applied Mathematics | 2002-12-06 | Paper |
| scientific article; zbMATH DE number 1741320 (Why is no real title available?) | 2002-05-15 | Paper |
Computation of approximate real roots of real polynomials with error terms and their applications
RIMS Kokyuroku | 2001-09-17 | Paper |
| scientific article; zbMATH DE number 1428942 (Why is no real title available?) | 2000-04-10 | Paper |
| scientific article; zbMATH DE number 1379094 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1322497 (Why is no real title available?) | 1999-11-02 | Paper |
