{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00015818","sets":["581:885:890"]},"path":["890"],"owner":"1","recid":"15818","title":["行置換によるスパース行列の効率的縮小アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"1985-03-15"},"_buckets":{"deposit":"dc814b7f-d207-406b-a55d-9b5e7a508a32"},"_deposit":{"id":"15818","pid":{"type":"depid","value":"15818","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"行置換によるスパース行列の効率的縮小アルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"行置換によるスパース行列の効率的縮小アルゴリズム"},{"subitem_title":"An Effcient Algorithm of Reducing Sparse Matrices by Row Displacements","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1985-03-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"徳島大学工学部情報工学科"},{"subitem_text_value":"徳島大学工学部情報工学科"},{"subitem_text_value":"徳島大学工学部情報工学科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information Science and Systems Engineering, Faculty of Engineering, The University of Tokushima","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Science and Systems Engineering, Faculty of Engineering, The University of Tokushima","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Science and Systems Engineering, Faculty of Engineering, The University of Tokushima","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/15818/files/IPSJ-JNL2602001.pdf"},"date":[{"dateType":"Available","dateValue":"1987-03-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL2602001.pdf","filesize":[{"value":"570.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f5e564ed-d064-44b5-b71f-a50572f76804","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1985 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"青江, 順一"},{"creatorName":"山本, 米雄"},{"creatorName":"島田, 良作"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Junichi, Aoe","creatorNameLang":"en"},{"creatorName":"Yoneo, Yamamoto","creatorNameLang":"en"},{"creatorName":"Ryosaku, Shimada","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Tarjanらは スバース行列の縮小法として行置超換による方法(ffd 法と呼ぶ)を採用し 次を満足するための条件(HD条件と呼ぶ)とその理論的評価を与えた.(1)行列のすべての非零要素数をn 行の大きさをmとするとき 記憶量をn+2m語とする.(2)最悪の場合の探索時間をΟ(1)とする.本論文では 種々のスパース行列に対する実験結果に基づいてffd法とHD条件を評価し ffd法の改善法とHD条件に代る経験的な条件を提案する.まず ffd法の行置換法と行ソート法が改善され 改善された縮小法をffds 法と呼ぶ.次に このffds法が上記の(1)と(2)を満足するための条件(AV条件と呼ぶ)を提案する.このAV条件は経験的なものであるが HD条件より判定が能率的に行え しかも適用できるスパース行列の範囲がHD条件より大幅に広くなる.最後に AV条件を満足しない行列に対する縮小法の拡張を考える.Tarjanらの拡張法では HD条件以外にED条件と呼ばれるもう一つの条件を必要とする.しかし 本論文による拡張法ではAV条件をそのまま使用できるので 行列縮小化の条件をつねに一つに統一できる特徴がある.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"218","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"211","bibliographicIssueDates":{"bibliographicIssueDate":"1985-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"26"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":15818,"updated":"2025-01-23T00:08:51.134412+00:00","links":{},"created":"2025-01-18T22:49:15.767342+00:00"}