@article{oai:u-ryukyu.repo.nii.ac.jp:02007386,
 author = {喜屋武, 盛基 and 白川, 功 and 尾崎, 弘 and Kyan, Seiki and Shirakawa, Isao and Ozaki, Hiroshi},
 issue = {7},
 journal = {琉球大学理工学部紀要. 工学篇, Bulletin of Science & Engineering Division, University of the Ryukyus. Engineering},
 month = {Mar},
 note = {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., 紀要論文},
 pages = {137--150},
 title = {スパース行列のガウス消去における最適ピボッテング・アルゴリズムとそのフォトランプログラム},
 year = {1974}
}