Akira Terui

Orcid: 0000-0003-0846-3643

According to our database1, Akira Terui authored at least 25 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Computer-assisted proofs of "Kariya's theorem" with computer algebra.
CoRR, 2023

Inverse Kinematics and Path Planning of Manipulator Using Real Quantifier Elimination Based on Comprehensive Gröbner Systems.
Proceedings of the Computer Algebra in Scientific Computing - 25th International Workshop, 2023

2022
Exact Algorithms for Computing Generalized Eigenspaces of Matrices via Annihilating Polynomials.
CoRR, 2022

The GPGCD Algorithm with the Bézout Matrix for Multiple Univariate Polynomials.
CoRR, 2022

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

2020
Solving System of Nonlinear Equations with the Genetic Algorithm and Newton's Method.
CoRR, 2020

A Design and an Implementation of an Inverse Kinematics Computation in Robotics Using Gröbner Bases.
Proceedings of the Mathematical Software - ICMS 2020, 2020

2019
The GPGCD algorithm with the Bézout matrix.
ACM Commun. Comput. Algebra, 2019

2018
Fast Algorithms for Computing Eigenvectors of Matrices via Pseudo Annihilating Polynomials.
CoRR, 2018

Fast Algorithm for Calculating the Minimal Annihilating Polynomials of Matrices via Pseudo Annihilating Polynomials.
CoRR, 2018

2016
An Automated Deduction and Its Implementation for Solving Problem of Sequence at University Entrance Examination.
Proceedings of the Mathematical Software - ICMS 2016, 2016

2014
An Extension and Efficient Calculation of the Horner's Rule for Matrices.
Proceedings of the Mathematical Software - ICMS 2014, 2014

Developing Linear Algebra Packages on Risa/Asir for Eigenproblems.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2013
GPGCD: An iterative method for calculating approximate GCD of univariate polynomials.
Theor. Comput. Sci., 2013

Calculating approximate GCD of multiple univariate polynomials using approximate syzygies.
ACM Commun. Comput. Algebra, 2013

2011
Abstracts from RIMS workshop on developments in computer algebra research.
ACM Commun. Comput. Algebra, 2011

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

GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials.
ACM Commun. Comput. Algebra, 2010

2009
Computing clustered close-roots of univariate polynomials.
Proceedings of the Symbolic Numeric Computation, 2009

An iterative method for calculating approximate GCD of univariate polynomials.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008
Recursive Polynomial Remainder Sequence and its Subresultants.
CoRR, 2008

Subresultants in Recursive Polynomial Remainder Sequence.
CoRR, 2008

2005
Recursive Polynomial Remainder Sequence and the Nested Subresultants.
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2002
A formula for separating small roots of a polynomial.
SIGSAM Bull., 2002

1997
Approximate algebraic computation: practice and problems.
SIGSAM Bull., 1997


  Loading...