| Budget Amount *help |
¥4,810,000 (Direct Cost: ¥3,700,000、Indirect Cost: ¥1,110,000)
Fiscal Year 2018: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2017: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2016: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
|
|---|
| Outline of Final Research Achievements |
In calculating an approximate Greatest Common Divisor (GCD) of univariate polynomials which is a basis of the calculation of blending surfaces of algebraic surfaces, we have developed a new algorithm based on the Bezout resultant.
For efficient algorithm and implementation of matrix computation used in algorithms such as approximate GCD computation, we have developed new algorithms for computing the matrix inverse using the extended Horner's rule and pseudo minimal polynomials or pseudo annihilating polynomials. We also have made the efficient implementation of an algorithm for computing eigenvectors using parallel computation of the Horner's rule for matrix polynomials.
|
