@article{oai:u-ryukyu.repo.nii.ac.jp:02007397,
author = {喜屋武, 盛基 and Kiyan, Seiki},
issue = {8},
journal = {琉球大学理工学部紀要. 工学篇, Bulletin of Science & Engineering Division, University of the Ryukyus. Engineering},
month = {Jan},
note = {The coefficient matrix of a very large system of equations is generally very sparse, i. e., non-zero elements are very few, say, less than 10 percent of total number of elements. Thus in computer assisted analysis of such a system, sparsity oriental techniques for solution and data storage are very important. Recently, many papers have been published on the sparse matrix techniques. In this paper, three algorithms of so cal1ed "minimum fill-in" have been studied and actually programmed for FACOM 230-15 computer. Comparisions are made from the results of actual computations., 紀要論文},
pages = {105--111},
title = {スパース行列の最適ピポッティングの諸手法とそれらの比較研究},
year = {1975}
}