乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T18:37:51Z","timestamp":1726511871210},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"vor","delay-in-days":1491,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"name":"GIST Research Institute"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1016\/j.tcs.2019.10.024","type":"journal-article","created":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T16:28:57Z","timestamp":1571243337000},"page":"173-178","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Roots of quaternion polynomials: Theory and computation"],"prefix":"10.1016","volume":"800","author":[{"given":"Takis","family":"Sakkalis","sequence":"first","affiliation":[]},{"given":"Kwanghee","family":"Ko","sequence":"additional","affiliation":[]},{"given":"Galam","family":"Song","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2012","series-title":"Numerical Methods for Equations and Its Applications","author":"Argyros","key":"10.1016\/j.tcs.2019.10.024_br0010"},{"key":"10.1016\/j.tcs.2019.10.024_br0020","doi-asserted-by":"crossref","first-page":"297","DOI":"10.13001\/1081-3810.1240","article-title":"Zeros of unilateral quaternionic polynomials","volume":"15","author":"De Leo","year":"2006","journal-title":"Electron. J. Linear Algebra"},{"issue":"4","key":"10.1016\/j.tcs.2019.10.024_br0030","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1090\/S0002-9904-1944-08125-1","article-title":"The \u201cfundamental theorem of algebra\u201d for quaternions","volume":"50","author":"Eilenberg","year":"1944","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/j.tcs.2019.10.024_br0040","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jsc.2013.07.001","article-title":"Scalar-vector algorithm for the roots of quadratic quaternion polynomials, and the characterization of quintic rational rotation-minimizing frame curves","volume":"58","author":"Farouki","year":"2013","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.tcs.2019.10.024_br0060","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s00032-008-0093-0","article-title":"On the multiplicity of zeros of polynomials with quaternionic coefficients","volume":"76","author":"Gentili","year":"2008","journal-title":"Milan J. Math."},{"key":"10.1016\/j.tcs.2019.10.024_br0070","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1007\/s00209-007-0254-9","article-title":"The fundamental theorem of algebra for Hamilton and Cayley numbers","volume":"259","author":"Gentili","year":"2008","journal-title":"Math. Z."},{"key":"10.1016\/j.tcs.2019.10.024_br0080","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1090\/S0002-9947-1965-0195853-2","article-title":"On the zeros of polynomials over division rings","volume":"116","author":"Gordon","year":"1965","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"10.1016\/j.tcs.2019.10.024_br0090","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1137\/090748871","article-title":"A note on the computation of all zeros of simple quaternionic polynomials","volume":"48","author":"Janovska","year":"2010","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/j.tcs.2019.10.024_br0100","doi-asserted-by":"crossref","first-page":"1852","DOI":"10.1016\/j.camwa.2009.08.034","article-title":"A new method for roots of monic quaternionic quadratic polynomial","volume":"58","author":"Jia","year":"2009","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.tcs.2019.10.024_br0110","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.jco.2013.03.001","article-title":"Algorithms for quaternion polynomial root-finding","volume":"29","author":"Kalantari","year":"2013","journal-title":"J. Complex."},{"key":"10.1016\/j.tcs.2019.10.024_br0120","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1080\/00029890.1941.11991158","article-title":"Equations in quaternions","volume":"48","author":"Niven","year":"1941","journal-title":"Am. Math. Mon."},{"key":"10.1016\/j.tcs.2019.10.024_br0140","first-page":"379","article-title":"On the structure of the set of zeros of quaternionic polynomials","volume":"49","author":"Pogorui","year":"2004","journal-title":"Complex Var. Elliptic Funct."},{"key":"10.1016\/j.tcs.2019.10.024_br0160","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1016\/S0898-1221(01)00235-8","article-title":"Computing the zeros of quaternion polynomials","volume":"42","author":"Serodio","year":"2001","journal-title":"Int. J. Comput. Math. Appl."},{"issue":"4","key":"10.1016\/j.tcs.2019.10.024_br0170","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1515\/GMJ.2003.745","article-title":"On the roots of polynomials over division algebras","volume":"10","author":"Topuridze","year":"2003","journal-title":"Georgian Math. J."},{"issue":"6","key":"10.1016\/j.tcs.2019.10.024_br0180","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1007\/s10958-009-9530-z","article-title":"On roots of quaternion polynomials","volume":"160","author":"Topuridze","year":"2009","journal-title":"J. Math. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751930653X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751930653X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T11:47:35Z","timestamp":1712404055000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439751930653X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":15,"alternative-id":["S030439751930653X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2019.10.024","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Roots of quaternion polynomials: Theory and computation","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2019.10.024","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}