A Challenge to Relative Errors by Numerical Algorithms with Positivity
Project/Area Number |
23654032
|
Research Category |
Grant-in-Aid for Challenging Exploratory Research
|
Allocation Type | Multi-year Fund |
Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
Research Institution | Kyoto University |
Principal Investigator |
|
Project Period (FY) |
2011 – 2013
|
Project Status |
Completed (Fiscal Year 2013)
|
Budget Amount *help |
¥3,510,000 (Direct Cost: ¥2,700,000、Indirect Cost: ¥810,000)
Fiscal Year 2013: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2012: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Fiscal Year 2011: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
|
Keywords | 固有値計算 / 特異値計算 / 相対誤差 / 正値性 / 可積分アルゴリズム / 離散可積分系 / 漸近解析 / 行列式 / 計算数学 |
Research Abstract |
In this project, we investigate the perturbations on singular values and the forward errors of the mdLVs variables, which occur in the mdLVs algorithm, through two kinds of error analysis in floating point arithmetic. Therefore the forward stability of the mdLVs algorithm is proved. Next we present a new similarity transformation named the dLV_\infty similarity transformation by considering the case where the discretization parameter \delta(n) goes to infinity in the integrable dLV system. It is proved that the singular values of bidiagonal matrix are computable by using the dLV_\infty transformation repeatedly. Therefore we clarify that the relative perturbations in the singular values are sufficiently small through the mixed forward-backward error analysis. We finally show that the dLV_\infty transformation is forward stable.
|
Report
(4 results)
Research Products
(53 results)