| Project/Area Number |
11650395
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
情報通信工学
|
|---|
| Research Institution | Chuo University |
|---|
Principal Investigator |
YAMAMURA Kiyotaka Faculty of Science and Engineering, Chuo University, Professor, 理工学部, 教授 (30182603)
|
|---|
| Project Period (FY) |
1999 – 2001
|
| Project Status |
Completed (Fiscal Year 2001)
|
| Budget Amount *help |
¥3,600,000 (Direct Cost: ¥3,600,000)
Fiscal Year 2001: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 2000: ¥1,100,000 (Direct Cost: ¥1,100,000)
Fiscal Year 1999: ¥1,800,000 (Direct Cost: ¥1,800,000)
|
|---|
| Keywords | nonlinear system / numerical analysis / nonlinear circuit / LSI design / circuit simulation / polymer chemistry / linear programming / interval analysis / 多相平衡 |
|---|
| Research Abstract |
In this project, we first propose a new algorithm using the fixed-point homotopy that is globally convergent for modified nodal equations. Using this algorithm, bipolar analog integrated circuits with more than 15,000 elements are solved efficiently. We prove a theorem that guarantees the global convergence of the proposed algorithm under mild conditions. We also show that the proposed algorithm converges to a stable operating point with high possibility.
We next proposed an efficient algorithm for finding all solutions of piecewise-linear resistive circuits using linear programming. Using this algorithm, all solutions of large scale problems, including those where the number of variables is 300 and the number of linear regions is 10^<300>, could be solved in practical computation time.
We also studied the problem of calculating multiphase equilibria of polymer solutions, which is a very difficult problem in polymer chemistry. We discovered an interesting phenomena termed the reentrant three-phase equilibria of polymer solutions, and exploiting this phenomena, we calculated four-phase equilibria of polymer solutions for the first time.
|
