{"links":{},"id":225675,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00225675","sets":["1164:2240:11176:11246"]},"path":["11246"],"owner":"44499","recid":"225675","title":["フィルタを用いた行列固有値問題の近似固有対と精度の改良"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-05-03"},"_buckets":{"deposit":"59dcf00c-527e-4726-9ca5-c446f35a5aba"},"_deposit":{"id":"225675","pid":{"type":"depid","value":"225675","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"フィルタを用いた行列固有値問題の近似固有対と精度の改良","author_link":["597663"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"フィルタを用いた行列固有値問題の近似固有対と精度の改良"},{"subitem_title":"Accuracy Improvement of Approximate Eigenpairs of Matrix Eigenproblems by Using Filter","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"数値計算","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2023-05-03","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京都立大学数理科学専攻"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Mathematical Sciences, Tokyo Metropolitan 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/225675/files/IPSJ-HPC23189008.pdf","label":"IPSJ-HPC23189008.pdf"},"date":[{"dateType":"Available","dateValue":"2025-05-03"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC23189008.pdf","filesize":[{"value":"6.5 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":"a4df9e80-f0f2-45f8-99a4-79e373611191","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":[{}]}]},"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":"行列の固有値問題で固有値が指定された狭い区間にある固有対を近似して求める．それに用いるフィルタには，計算資源を節約するために，少数のレゾルベントの線形結合のチェビシェフ多項式を採用する．フィルタ 1 回の適用では得られる近似固有対の精度が十分にはならない場合に，同一のフィルタをベクトルの組に 2 回適用するよりも計算の手間を減らすために，本来のフィルタの適用の前あるいは後に，レゾルベントの線形結合は同じだがチェビシェフ多項式の次数を下げたフィルタを適用する．この方法を実験してその効果について調べた．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We week to approximate the eigenpairs of a matrix eigenvalue problem whose eigenvalues lie within a specified narrow range. The filter used is a Chebyshev polynomial of a linear combination of a small number of resolvents to save computational resources. If the accuracy of the approximate eigenpairs obtained with a single application of the filter is not sufficient, a filter with the same linear combination of resolvents but with a reduced degree of the Chebyshev polynomial is applied before or after the original filter application to reduce computational effort compared to applying the same filter twice to a set of vectors. The effect of this method was investigated by experimentation.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"63","bibliographic_titles":[{"bibliographic_title":"研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-05-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"2023-HPC-189"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:25:10.784041+00:00","updated":"2025-01-19T12:43:10.776099+00:00"}