{"updated":"2025-01-22T15:54:27.768542+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00033010","sets":["1164:2735:2742:2745"]},"path":["2745"],"owner":"1","recid":"33010","title":["上２重対角のテスト行列を作成するためのアルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-06-25"},"_buckets":{"deposit":"7873ad46-01cc-435b-9488-cd55d64ee284"},"_deposit":{"id":"33010","pid":{"type":"depid","value":"33010","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":"Algorithms for Generating Bidiagonal Test Matrices","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2007-06-25","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"奈良女子大学大学院人間文化研究科"},{"subitem_text_value":"新潟大学大学院自然科学研究科"},{"subitem_text_value":"京都府立大学人間環境学部"},{"subitem_text_value":"京都大学大学院情報学研究科／JST  SORST"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Humanities and Sciences, Nara Women's University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Science & Technology, Niigata University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Human Environment, Kyoto Prefectural University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Informatics, Kyoto University / SORST, JST","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/33010/files/IPSJ-MPS07065003.pdf"},"date":[{"dateType":"Available","dateValue":"2009-06-25"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS07065003.pdf","filesize":[{"value":"327.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":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"6f508d27-59d0-44a2-91f0-d057ac015ea8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2007 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"髙田, 雅美"},{"creatorName":"木村, 欣司"},{"creatorName":"岩崎, 雅史"},{"creatorName":"中村, 佳正"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masami, TAKATA","creatorNameLang":"en"},{"creatorName":"Kinji, KIMURA","creatorNameLang":"en"},{"creatorName":"Masashi, IWASAKI","creatorNameLang":"en"},{"creatorName":"Yoshimasa, NAKAMURA","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文では、与えられた特異値と特異ベクトルからテスト行列を構成するためのアルゴリズムを２つ提案する。1つ目のアルゴリズムは、Golub-Kahan-Lanczos 法を基にしており、計算量は O(m2) である。ここで、m は行列サイズを表す。２つ目のアルゴリズムは、Jacobi 法を用いる。与えられた特異値のみから構成する場合、計算量は O(m2) である。また、特異ベクトルも与える場合、O(m3） となる。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we propose two algorithms to generate matrices with desired singular values and singular vectors. The first algorithm is based on the Golub-Kahan-Lanczos method. This requires O(m2) computational cost, where m is dimension. The second algorithm uses the Jacobi rotation and the bulge-chasing. If matrices with desired singular values are needed, the computational cost is O(m2). If matrices with not only desired singular values but also desired singular vectors are needed, the computational cost becomes O(m3).","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"12","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"9","bibliographicIssueDates":{"bibliographicIssueDate":"2007-06-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"64(2007-MPS-065)","bibliographicVolumeNumber":"2007"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:01:57.624373+00:00","id":33010,"links":{}}