| Budget Amount *help |
¥5,070,000 (Direct Cost: ¥3,900,000、Indirect Cost: ¥1,170,000)
Fiscal Year 2015: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2014: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2012: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2011: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Outline of Final Research Achievements |
The purpose of this work is to establish reliable numerical algorithms for the Jordan problem (JP) and Kronecker problem (KP), where not only the canonical form but transformation matrices are computed in both cases. Shedding light on a stratificated structure [see K. Kudo et al., JSIAM Letters, Vol.2 (2010) pp. 119-122 for JP and Y. Kakinuma et al., JSIAM Letters, Vol. 1 (2009) pp. 60-63 for KP], we proposed an efficient SVD-based algorithm for each problem, incorporated with the standard preprocessing reducing an input square matrix (resp. an input matrix pencil) to a block Schur form for JP (resp. a generalized upper triangular form for KP). One of the important contributions of this work from a practical viewpoint is to offer a complete numerical solution to a generalized eigenvalue problem of general type, where the associated matrix pencil might be singular.
|
