{"created":"2025-01-18T23:47:29.695625+00:00","updated":"2025-01-21T10:56:12.580272+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00102166","sets":["1164:2735:7461:7623"]},"path":["7623"],"owner":"11","recid":"102166","title":["Accelerating the Numerical Computation of Positive Roots of Polynomials using Improved Bounds"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-07-14"},"_buckets":{"deposit":"9ec3a92f-b271-4c96-b073-a4fbb05f8b4c"},"_deposit":{"id":"102166","pid":{"type":"depid","value":"102166","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Accelerating the Numerical Computation of Positive Roots of Polynomials using Improved Bounds","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Accelerating the Numerical Computation of Positive Roots of Polynomials using Improved Bounds"},{"subitem_title":"Accelerating the Numerical Computation of Positive Roots of Polynomials using Improved Bounds","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2014-07-14","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Informatics, Kyoto University"},{"subitem_text_value":"Graduate School of Informatics, Kyoto University"},{"subitem_text_value":"Graduate School of Informatics, Kyoto University"},{"subitem_text_value":"Academic Group of Information and Computer Sciences, Nara Women's University"},{"subitem_text_value":"Graduate School of Informatics, Kyoto University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Informatics, Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Informatics, Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Informatics, Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Academic Group of Information and Computer Sciences, Nara Women's University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Informatics, Kyoto 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/102166/files/IPSJ-MPS14099006.pdf"},"date":[{"dateType":"Available","dateValue":"2016-07-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS14099006.pdf","filesize":[{"value":"596.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":"b71eb582-a2cb-49ce-b150-5636c91369fe","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kinji, Kimura"},{"creatorName":"Takuto, Akiyama"},{"creatorName":"Hiroyuki, Ishigami"},{"creatorName":"Masami, Takata"},{"creatorName":"Yoshimasa, Nakamura"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kinji, Kimura","creatorNameLang":"en"},{"creatorName":"Takuto, Akiyama","creatorNameLang":"en"},{"creatorName":"Hiroyuki, Ishigami","creatorNameLang":"en"},{"creatorName":"Masami, Takata","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":"The continued fraction method for isolating the positive roots of a univariate polynomial equation is based on Vincent's theorem, which computes all of the real roots of polynomial equations. In this paper, we propose two new lower bounds which accelerate the fraction method. The two proposed bounds are derived from a theorem stated by Akritas et al., and use different pairing strategies for the coefficients of the target polynomial equations from the bounds proposed by Akritas et al. Numerical experiments show that the proposed lower bounds are more effective than existing bounds for some special polynomial equations and random polynomial equations, and are competitive with them for other special polynomial equations.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The continued fraction method for isolating the positive roots of a univariate polynomial equation is based on Vincent's theorem, which computes all of the real roots of polynomial equations. In this paper, we propose two new lower bounds which accelerate the fraction method. The two proposed bounds are derived from a theorem stated by Akritas et al., and use different pairing strategies for the coefficients of the target polynomial equations from the bounds proposed by Akritas et al. Numerical experiments show that the proposed lower bounds are more effective than existing bounds for some special polynomial equations and random polynomial equations, and are competitive with them for other special polynomial equations.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"4","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2014-07-14","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"2014-MPS-99"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":102166,"links":{}}