スパース行列のガウス消去における最適ピボッテング・アルゴリズムとそのフォトランプログラム
スポンサーリンク
概要
- 論文の詳細を見る
In the process of solving the linear epuation by the Gaussian Elimination or other comparable technigues, a computational interest is the pivotal ordering of the coefficient matix for the given set of epuations. This paper describes the algorithm fit for a large scale sparse matrices. The algorithm is essentially so called "minimum fill-in" but the method to obtain the minimum fill-in is unigue and some other criteria are added in oder to improve the optimality. Comparisions are made withe Ghausi method by actual program and results are given.
- 琉球大学理工学部の論文
- 1974-03-01
琉球大学理工学部 | 論文
- ワイヤロ-プの破断事故原因に関する調査と分析
- 断続合成桁の曲げ性状について
- Corrections to "On the Cohomology of the mod p Steenrod Algebra〔琉球大学理工学部紀要理学篇 第18号 p9〜58〕"
- Relations between the Toda brackets to the differentials in the Adams and co-Adams spectral sequences
- On the Cohomology of the mod p Steenrod Algebra