{"id":227819,"updated":"2025-01-19T12:03:08.279183+00:00","links":{},"created":"2025-01-19T01:27:04.270976+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00227819","sets":["1164:2240:11176:11333"]},"path":["11333"],"owner":"44499","recid":"227819","title":["高周波電磁界シミュレーションにおけるICCG法の並列化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-09-19"},"_buckets":{"deposit":"2b4eae19-ef65-4435-98de-dee828f735be"},"_deposit":{"id":"227819","pid":{"type":"depid","value":"227819","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"高周波電磁界シミュレーションにおけるICCG法の並列化","author_link":["607416","607415","607414"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"高周波電磁界シミュレーションにおけるICCG法の並列化"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"高性能計算","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2023-09-19","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"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/227819/files/IPSJ-HPC23191007.pdf","label":"IPSJ-HPC23191007.pdf"},"date":[{"dateType":"Available","dateValue":"2025-09-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC23191007.pdf","filesize":[{"value":"1.0 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"14"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"fe488db7-19cd-499e-9ee8-3c049c6fabc4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小山, 雄世"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"桝井, 晃基"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"伊野, 文彦"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10463942","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8841","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿では，高周波電磁界シミュレーションの高速化を目指し，前処理付き反復法の並列化手法を提案する．ICCG 法における前進後退代入の並列化には，要素の棄却によるデータ依存の除去が有効であるが，過度な棄却は反復法の収束性を悪化させることが知られている．そこで提案手法は，少ない棄却で高い並列性を引き出すために，行列の非ゼロ要素の分布，特に対角要素の有無に着目して前処理行列を 3 つの領域に分類する．対角要素を含む 2 つの領域に対しては棄却を許容し，従来手法であるブロック ICCG 法を適用する．一方，対角要素を含まない領域は，要素を棄却することなく，まとめて並列処理する．高周波電磁場問題の対称行列に対して，提案手法を適用した反復法の収束性や前進後退代入に要する計算時間を調査した．提案手法は同じブロック数の BICCG 法と比較して最大 59.8% 反復回数を削減し，最大 4. 9倍の速度向上率を達成した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-09-19","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7","bibliographicVolumeNumber":"2023-HPC-191"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}