{"created":"2021-03-01T05:52:58.769019+00:00","id":1264,"links":{},"metadata":{"_buckets":{"deposit":"bd08306d-f079-4adc-bebc-e410e609470c"},"_deposit":{"id":"1264","owners":[],"pid":{"revision_id":0,"type":"depid","value":"1264"},"status":"published"},"_oai":{"id":"oai:repository.nii.ac.jp:00001264","sets":["136"]},"author_link":[],"control_number":"1264","item_5_biblio_info_30":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2011-04-04","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"27","bibliographicPageStart":"1","bibliographic_titles":[{"bibliographic_title":"NIIテクニカル・レポート","bibliographic_titleLang":"ja"},{"bibliographic_title":"NII Technical Report","bibliographic_titleLang":"en"}]}]},"item_5_description_28":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Stationary inner iterations in combination with Krylov subspace methods are proposed for least squares problems. The inner iterations are efficient in terms of computational work and memory, and serve as powerful preconditioners also for ill-conditioned and rank-deficient least squares problems. Theoretical justifications for using the inner iterations as preconditioners are presented. Numerical experiments for overdetermined least squares problems including ill-conditioned and rank-deficient problems show that the proposed methods outperform previous methods.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_5_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.20736/0000001264","subitem_identifier_reg_type":"JaLC"}]},"item_5_publisher_31":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"国立情報学研究所","subitem_publisher_language":"ja"}]},"item_5_source_id_32":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1346-5597","subitem_source_identifier_type":"ISSN"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"保國, 惠一","creatorNameLang":"ja"},{"creatorName":"Morikuni, Keiichi","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"速水, 謙","creatorNameLang":"ja"},{"creatorName":"Hayami, Ken","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-03-13"}],"displaytype":"detail","filename":"11-001E.pdf","filesize":[{"value":"823.6 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"NII Technical Report (NII-2011-001E)：Inner-Iteration Krylov Subspace Methods for Least Squares Problems","url":"https://repository.nii.ac.jp/record/1264/files/11-001E.pdf"},"version_id":"e13f170d-a073-4ccc-8caf-7761de4d2a02"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"テクニカルレポート","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"Technical Report","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"NII Technical Report (NII-2011-001E)：Inner-Iteration Krylov Subspace Methods for Least Squares Problems","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"NII Technical Report (NII-2011-001E)：Inner-Iteration Krylov Subspace Methods for Least Squares Problems","subitem_title_language":"en"}]},"item_type_id":"5","owner":"1","path":["136"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2019-03-13"},"publish_date":"2019-03-13","publish_status":"0","recid":"1264","relation_version_is_last":true,"title":["NII Technical Report (NII-2011-001E)：Inner-Iteration Krylov Subspace Methods for Least Squares Problems"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-11T01:51:16.045068+00:00"}