2023-12-11T02:23:49Z
https://u-ryukyu.repo.nii.ac.jp/oai
oai:u-ryukyu.repo.nii.ac.jp:02007397
2022-10-31T03:20:14Z
1642837622505:1642837722116:1642837725634
1642838403551:1642838406845
スパース行列の最適ピポッティングの諸手法とそれらの比較研究
On Some Optimal pivoting Algorithms and their Comparisons
喜屋武, 盛基
Kiyan, Seiki
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.
紀要論文
http://purl.org/coar/resource_type/c_6501
琉球大学理工学部
Science and Engineering Division, University of the Ryukyus
1975-01-30
VoR
http://hdl.handle.net/20.500.12000/26297
0387-429X
AN00250785
琉球大学理工学部紀要. 工学篇
Bulletin of Science & Engineering Division, University of the Ryukyus. Engineering
8
111
105
jpn
open access