| Budget Amount *help |
¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
Fiscal Year 2013: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2012: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2010: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
|
|---|
| Research Abstract |
We proposed an algorithm for computing a structured Groebner basis approximately. With this algorithm, even if the input has some numerical error, we can compute their Groebner basis which are widely used for simplifying algebraic relations for example. For approximate polynomial GCD, we extended the concept to polynomials over integers and gave some special lattice to make it being compatible with multiple precision integers. Especially for the well known approximate polynomial GCD algorithm, QRGCD, we extended it with much theoretical considerations and proposed ExQRGCD algorithm. Moreover, for those results, to achieve that many people can use the results, we implemented them with C and published it on the website. The name of library is "LIBSNAP".
|
