( en | de | ru )

 

Disambiguation of "Terui, Akira"

Author of the publication

copydeleteadd this publication to your clipboard
An Extension and Efficient Calculation of the Horner's Rule for Matrices.

, , and . ICMS, volume 8592 of Lecture Notes in Computer Science, page 346-351. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Akira Hayashima

Akira Hori

Akira Satake

Akira Hayashima

Akira Yasui

 

Other publications of authors with the same name

Recursive Polynomial Remainder Sequence and the Nested Subresultants.. CASC, volume 3718 of Lecture Notes in Computer Science, page 445-456. Springer, (2005)Inverse Kinematics and Path Planning of Manipulator Using Real Quantifier Elimination Based on Comprehensive Gröbner Systems., , and . CASC, volume 14139 of Lecture Notes in Computer Science, page 393-419. Springer, (2023)Fast Algorithms for Computing Eigenvectors of Matrices via Pseudo Annihilating Polynomials., , and . CoRR, (2018)Developing Linear Algebra Packages on Risa/Asir for Eigenproblems., , and . ICMS, volume 8592 of Lecture Notes in Computer Science, page 321-324. Springer, (2014)GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials.. CASC, volume 6244 of Lecture Notes in Computer Science, page 238-249. Springer, (2010)The GPGCD Algorithm with the Bézout Matrix., and . CASC, volume 12291 of Lecture Notes in Computer Science, page 170-187. Springer, (2020)An iterative method for calculating approximate GCD of univariate polynomials.. ISSAC, page 351-358. ACM, (2009)Fast Algorithm for Calculating the Minimal Annihilating Polynomials of Matrices via Pseudo Annihilating Polynomials., , and . CoRR, (2018)An Automated Deduction and Its Implementation for Solving Problem of Sequence at University Entrance Examination., , , and . ICMS, volume 9725 of Lecture Notes in Computer Science, page 82-89. Springer, (2016)Computing clustered close-roots of univariate polynomials., and . SNC, page 177-184. ACM, (2009)