Development of robust and efficient algorithms in numerical linear algebra
Project/Area Number |
23700023
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Multi-year Fund |
Research Field |
Fundamental theory of informatics
|
Research Institution | Tokyo Woman's Christian University |
Principal Investigator |
OGITA Takeshi 東京女子大学, 現代教養学部, 准教授 (00339615)
|
Project Period (FY) |
2011-04-28 – 2015-03-31
|
Project Status |
Completed (Fiscal Year 2014)
|
Budget Amount *help |
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2014: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2013: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2011: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
|
Keywords | 数値線形代数 / 行列分解 / 高精度計算 / 悪条件問題 / 数値計算手法 / アルゴリズム / 行列解析 / 情報基礎 / 数値計算 |
Outline of Final Research Achievements |
The purpose of this research is to create a framework of robust matrix factorization algorithms in numerical linear algebra. Since scientific computing is based on numerical linear algebra, development of such algorithms is very important. For this purpose, it was necessary to create a common framework for algorithms rather than considering details of individual algorithms. We succeeded in developing a robust factorization algorithm for real symmetric matrices. Moreover, we proposed robust numerical methods for eigenvalue problems and singular value problems.
|
Report
(5 results)
Research Products
(31 results)