Development of efficient algorithms and software for solving parametric systems
| Project/Area Number |
17340028
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Kobe University |
|---|
Principal Investigator |
NORO Masayuki Kobe University, Graduate School of Science, Professor (50332755)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
TAKAYAMA Nobuki Kobe University, Graduate School of Science, Professor (30188099)
SUZUKI Akira Kobe University, Administrative Office, Assistant Professor (50330519)
YOKOYAMA Kazuhiro Rikkyo University, Faculty of Science, Professor (30333454)
SATO Yosuke Tokyo University of Science, Faculty of Science, Professor (50257820)
OHARA Katsuyoshi Kanazawa University, Faculty of Science, Assistant Professor (00313635)
|
|---|
| Project Period (FY) |
2005 – 2007
|
| Project Status |
Completed (Fiscal Year 2007)
|
| Budget Amount *help |
¥14,290,000 (Direct Cost: ¥13,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2007: ¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2006: ¥4,800,000 (Direct Cost: ¥4,800,000)
Fiscal Year 2005: ¥5,200,000 (Direct Cost: ¥5,200,000)
|
|---|
| Keywords | Groebner Basis / F4 algorithm / Algebraic extension / CGB / Mathematical Software / Hvnereeometric equation / polynomial system / modular computation / F_4 / 斉次化 / 数式処理 / 計算代数 / パラメタ / dynamic evaluation |
|---|
| Research Abstract |
The purpose of this research is to develop efficient algorithms and software for solving polynomial systems or system of differential equations containing parameters. The research results are as follows:
1. Dynamic evaluation allows us to define algebraic numbers by non-irreducible defining polynomial. We reformulated the dynamic evaluation by using the notion of ideal quotient, and we proposed a modular method to improve the computation. We applied the new method for the computation of discrete comprehensive Groebner basis.
2. We proposed a new method for computing comprehensive Groebner basis (CGB) and comprehensive Groebner system (CGS). This method can be implemented by using Groebner basis computation over usual polynomial ring and it improves the computation of CGB or CGS.
3. We investigated the structures of polynomial ideals with parameters. In particular, we focused on the stability of parametric polynomial ideals and we found a periodicity and asymptotic behavior of such ideals in simple cases.
4. We proposed algorithms for doing division with remainder in rings of differential operators over the field of rational functions or the power series rings. We constructed convergent solutions of A-hypergeometric systems. By using the system of difference equations for Gauss hypergeometric functions, we derived their quadratic relations. For computing these objects we developed a software package named ‘yang' for computing in rings of difference-differential operators over the field of rational functions.
5. All the results above have been implemented in a computer algebra system Risa/Asir, which is available from our web site. In the conferences of Japan Mathematical Society, we held workshops named "Mathematical software and free documents". Furthermore, we constructed a virtual machine on which KNOPPIX/Math runs and we distributed DVDs containing the virtual machine.
|
Report
(4 results)
Research Products
(42 results)
