| Project/Area Number |
17560255
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
電力工学・電気機器工学
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
SHIMASAKI Masaaki Kyoto University, Graduate School of Engineering, Professor, 工学研究科, 教授 (60026242)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MATSUO Tetsuji Graduate School of Engineering, Associate Professor, 工学研究科, 助教授 (20238976)
IWASHITA Takeshi Academic Center for Computing and Media Studies, Associate Professor, 助教授 (30324685)
MIFUNE Takeshi Graduate School of Engineering, Research Associate, 工学研究科, 助手 (20362460)
|
|---|
| Project Period (FY) |
2005 – 2006
|
| Project Status |
Completed (Fiscal Year 2006)
|
| Budget Amount *help |
¥3,000,000 (Direct Cost: ¥3,000,000)
Fiscal Year 2006: ¥1,300,000 (Direct Cost: ¥1,300,000)
Fiscal Year 2005: ¥1,700,000 (Direct Cost: ¥1,700,000)
|
|---|
| Keywords | Electromagnetic Analyses / Mortar Finite Element Methods / Algebraic Multigrid Methods / Motor Analyses / Sliding Mesh / ベクトル磁気特性 |
|---|
| Research Abstract |
(1)Research on iterative methods for mortar finite element analyses
Two type formulations are selectable in mortar finite element analyses: one with Lagrange multipliers and the other with elimination of variables on the slave-side boundaries. We propose several new preconditioning techniques, which are based on the incomplete Cholesky decomposition, for linear equations arising from the both formulations. One of the proposed preconditioners applies the incomplete Cholesky decomposition to an approximate coefficient matrix. Numerical tests demonstrate that a combination of the variable elimination and approximation of the matrix is promising from a viewpoint of the elapsed time to solve the equations.
(2)Mortar finite element analyses using algebraic multigrid methods In a preliminary study, we develop algebraic multigrid (AMG) methods, which are efficient preconditioners for sparse matrices arising from the finite edge-and nodal element analyses.
For the mortar finite element analyses, w
… More
e propose an effective iterative solver preconditioned by the AMG method. Whereas the variable elimination formulation leads to a dense coefficient matrix, the AMG preconditioner is efficiently applied to a sparse matrix, which is an approximation of the original dense matrix. Numerical tests demonstrate an excellent performance of the proposed solver, compared with conventional solvers. The proposed solver can be applied to problems with anti-periodic boundary conditions.
(3)Fast nonlinear magnetic analyses using algebraic multigrid methods
We present a fast nonlinear finite element analysis with the magnetic scalar potential as unknowns. In the Newton-Raphson (NR) iterations, the linear equations are solved by an AMG preconditioned conjugate gradient (CG) solver. The line-search method is applied to improve the convergence of NR iterations. Numerical results show that the AMG-CG solver is efficient for the nonlinear analysis of a benchmark model. Moreover, a considerable speed-up is achieved by relaxing the convergence criterion of the CG iterations. Less
|
