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
Showing math.ACShow all

8 papers · 1 filter

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…

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…