HOME    About this site    mypage    Japanese    library    university    Feedback

University of the Ryukyus Repository >
Faculty of Engineering >
Bulletin >
The Bulletin of Science and Engineering Division University of the Ryukyus >
No.8 (1975/03) >

Title :スパース行列の最適ピポッティングの諸手法とそれらの比較研究
Title alternative :On Some Optimal pivoting Algorithms and their Comparisons
Authors :喜屋武, 盛基
Authors alternative :Kiyan, Seiki
Issue Date :30-Jan-1975
Abstract :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.
Type Local :紀要論文
ISSN :0387-429X
Publisher :琉球大学理工学部
URI :http://hdl.handle.net/20.500.12000/26297
Citation :琉球大学理工学部紀要. 工学篇 = Bulletin of Science & Engineering Division, University of the Ryukyus. Engineering no.8 p.105 -111
Appears in Collections:No.8 (1975/03)

Files in This Item:

File Description SizeFormat
NO8P105.pdf2173KbAdobe PDFView/Open