{"created":"2021-03-01T05:52:57.639878+00:00","id":1246,"links":{},"metadata":{"_buckets":{"deposit":"66ce415d-474e-46a2-a23a-c3fecb987a1d"},"_deposit":{"id":"1246","owners":[],"pid":{"revision_id":0,"type":"depid","value":"1246"},"status":"published"},"_oai":{"id":"oai:repository.nii.ac.jp:00001246","sets":["136"]},"author_link":[],"control_number":"1246","item_5_biblio_info_30":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2008-08-21","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"26","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":"In this paper, we construct a preconditioner for least squares problems min||b-Ax||, where A can be matrices with any shape and any rank. The preconditioner itself is a sparse approximation to the Moore-Penrose inverse of the coefficient matrix A. For this preconditioner, we give theoretical analysis to show that under certain assumption, the problem preconditioned by this preconditioner is equivalent to the original problem, and the GMRES method can determine a solution to the preconditioned problem before breakdown happens.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_5_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.20736/0000001246","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":"Cui, Xiaoke","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-12"}],"displaytype":"detail","filename":"08-008E.pdf","filesize":[{"value":"683.3 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"NII Technical Report (NII-2008-008E)：Greville's Method for Preconditioning Least Squares Problems","url":"https://repository.nii.ac.jp/record/1246/files/08-008E.pdf"},"version_id":"d001b5bf-9440-4720-87b5-925fda10bf8a"}]},"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-2008-008E)：Greville's Method for Preconditioning Least Squares Problems","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"NII Technical Report (NII-2008-008E)：Greville's Method for Preconditioning Least Squares Problems","subitem_title_language":"en"}]},"item_type_id":"5","owner":"1","path":["136"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2019-03-12"},"publish_date":"2019-03-12","publish_status":"0","recid":"1246","relation_version_is_last":true,"title":["NII Technical Report (NII-2008-008E)：Greville's Method for Preconditioning Least Squares Problems"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-05T06:27:08.056607+00:00"}