{"updated":"2025-01-22T22:56:45.498798+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00018145","sets":["934:1119:1120:1121"]},"path":["1121"],"owner":"1","recid":"18145","title":["A Fully Pipelined Multishift QR Algorithm for Parallel Solution of Symmetric Tridiagonal Eigenproblems"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-12-22"},"_buckets":{"deposit":"c1d2b2ba-4823-40db-b532-0844c917509c"},"_deposit":{"id":"18145","pid":{"type":"depid","value":"18145","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"A Fully Pipelined Multishift QR Algorithm for Parallel Solution of Symmetric Tridiagonal Eigenproblems","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Fully Pipelined Multishift QR Algorithm for Parallel Solution of Symmetric Tridiagonal Eigenproblems"},{"subitem_title":"A Fully Pipelined Multishift QR Algorithm for Parallel Solution of Symmetric Tridiagonal Eigenproblems","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"数値計算","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2008-12-22","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Computational Science & Engineering  Graduate School of Engineering  Nagoya University"},{"subitem_text_value":"Department of Computational Science & Engineering  Graduate School of Engineering  Nagoya University"},{"subitem_text_value":"Department of Computational Science & Engineering  Graduate School of Engineering  Nagoya University"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computational Science & Engineering, Graduate School of Engineering, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computational Science & Engineering, Graduate School of Engineering, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computational Science & Engineering, Graduate School of Engineering, Nagoya University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/18145/files/IPSJ-TACS0103003.pdf"},"date":[{"dateType":"Available","dateValue":"2010-12-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TACS0103003.pdf","filesize":[{"value":"604.7 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":"16"},{"tax":["include_tax"],"price":"0","billingrole":"11"},{"tax":["include_tax"],"price":"0","billingrole":"14"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c1df7fff-2826-467a-bda8-aef2fb896587","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takafumi, Miyata"},{"creatorName":"Yusaku, Yamamoto"},{"creatorName":"Shao-LiangZhang"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takafumi, Miyata","creatorNameLang":"en"},{"creatorName":"Yusaku, Yamamoto","creatorNameLang":"en"},{"creatorName":"Shao-Liang, Zhang","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11833852","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_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7829","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"In this paper  we propose a fully pipelined multishift QR algorithm to compute all the eigenvalues of a symmetric tridiagonal matrix on parallel machines. Existing approaches for parallelizing the tridiagonal QR algorithm  such as the conventional multishift QR algorithm and the deferred shift QR algorithm  have suffered from either inefficiency of processor utilization or deterioration of convergence properties. In contrast  our algorithm realizes both efficient processor utilization and improved convergence properties at the same time by adopting a new shifting strategy. Numerical experiments on a shared memory parallel machine (Fujitsu PrimePower HPC2500) with 32 processors show that our algorithm is up to 1.9 times faster than the conventional multishift algorithm and up to 1.7 times faster than the deferred shift algorithm.","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we propose a fully pipelined multishift QR algorithm to compute all the eigenvalues of a symmetric tridiagonal matrix on parallel machines. Existing approaches for parallelizing the tridiagonal QR algorithm, such as the conventional multishift QR algorithm and the deferred shift QR algorithm, have suffered from either inefficiency of processor utilization or deterioration of convergence properties. In contrast, our algorithm realizes both efficient processor utilization and improved convergence properties at the same time by adopting a new shifting strategy. Numerical experiments on a shared memory parallel machine (Fujitsu PrimePower HPC2500) with 32 processors show that our algorithm is up to 1.9 times faster than the conventional multishift algorithm and up to 1.7 times faster than the deferred shift algorithm.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"27","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌コンピューティングシステム（ACS）"}],"bibliographicPageStart":"14","bibliographicIssueDates":{"bibliographicIssueDate":"2008-12-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"1"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:50:57.345865+00:00","id":18145,"links":{}}