| Budget Amount *help |
¥6,370,000 (Direct Cost: ¥4,900,000、Indirect Cost: ¥1,470,000)
Fiscal Year 2016: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2015: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2014: ¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
|
|---|
| Outline of Final Research Achievements |
The purpose of the research project is to develop fast numerical algorithms for solving linear systems with matrix functions, and the research project mainly yielded the following results: (1) an efficient Krylov subspace method for solving linear systems with some matrix polynomials; (2) a method for boosting the speed of convergence of Newton's iterations to compute the matrix principal square root; (3) a cost-efficient variant of Incremental Newton method for the matrix principal pth root; (4) tensor decomposition algorithms for some special matrices. The results (2),(3) may lead to efficient Krylov solvers for the corresponding linear systems. The result (4) yields a novel direction for the case where the coefficient matrix has a tensor structure, which was not expected before the research project.
|
