{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:52:19Z","timestamp":1752231139561},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf02241861","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T19:34:05Z","timestamp":1131996845000},"page":"187-197","source":"Crossref","is-referenced-by-count":11,"title":["Complexity analysis of a process for simultaneously obtaining all zeros of polynomials"],"prefix":"10.1007","volume":"43","author":[{"given":"Wang","family":"Deren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Fengguang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02241861_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1137\/0711023","volume":"11","author":"G. Alefeld","year":"1974","unstructured":"Alefeld, G., Herzberger, J., On the convergence speed of some algorithms for the simultaneous approximation of polynomial roots, SIAM J. Numer, Anal.,11, (1974) pp 237\u2013243","journal-title":"SIAM J. Numer, Anal."},{"key":"BF02241861_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02280787","volume":"30","author":"G. V. Milovanovic","year":"1983","unstructured":"Milovanovic, G. V., Petkovic, M. S., On the convergence order of a modified method for simultaneous finding polynomial zeros, Computing,30 (1983) pp 171\u2013178","journal-title":"Computing"},{"key":"BF02241861_CR3","unstructured":"Karamardian, S., Fixed Points\u2014Algorithms and Applications, Academic Press, INC. (1977)"},{"key":"BF02241861_CR4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01404681","volume":"18","author":"I. Gargantini","year":"1972","unstructured":"Gargantini, I., Henrici, P., Circular arithmetic and the determination of polynomial zeros, Numer. Math.,18 (1972) pp 305\u2013320","journal-title":"Numer. Math."},{"key":"BF02241861_CR5","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1002\/zamm.19820621109","volume":"62","author":"M. S. Petkovic","year":"1982","unstructured":"Petkovic, M. S., Generalized root iterations for simultaneous determination of multile complex zeros, ZAMM,62 (1982) pp 627\u2013630","journal-title":"ZAMM"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241861.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02241861\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T23:15:48Z","timestamp":1557875748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02241861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF02241861"],"URL":"https:\/\/doi.org\/10.1007\/bf02241861","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}