| Budget Amount *help |
¥4,810,000 (Direct Cost: ¥3,700,000、Indirect Cost: ¥1,110,000)
Fiscal Year 2019: ¥520,000 (Direct Cost: ¥400,000、Indirect Cost: ¥120,000)
Fiscal Year 2018: ¥520,000 (Direct Cost: ¥400,000、Indirect Cost: ¥120,000)
Fiscal Year 2017: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2016: ¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000)
Fiscal Year 2015: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
|
|---|
| Outline of Final Research Achievements |
Symbolic-numeric computations are used in the case where the given algebraic expression has a priori error, or for solving the given non-numeric problem by some numerical methods. In this project, we had studied numerical and mathematical stabilities in fundamental symbolic-numeric computations used in many algorithms. Our contributions are as follows. 1) we built a better performance framework that covers and interchanges known approximate GCD algorithms, 2) we published its implementations, 3) we gave the theory of parametric greatest common divisors by means of comprehensive Groebner systems (CGS), and 4) we applied them to approximate squarefree decomposition.
|
