{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171457},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":[[1993,12]]},"DOI":"10.1007\/bf02248695","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T23:21:02Z","timestamp":1132010462000},"page":"349-361","source":"Crossref","is-referenced-by-count":3,"title":["On theR-order of some accelerated methods for the simultaneous finding of polynomial zeros"],"prefix":"10.1007","volume":"49","author":[{"given":"M. S.","family":"Petkovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. V.","family":"Stefanovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z. M.","family":"Marjanovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02248695_CR1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0025-5718-1973-0329236-7","volume":"27","author":"O. Aberth","year":"1973","unstructured":"Aberth, O.: Iteration methods for finding all zeros of a polynomial simultaneously. Math. Comp.27, 339\u2013344 (1973).","journal-title":"Math. Comp."},{"key":"BF02248695_CR2","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 zeros. SIAM J. Numer. Anal.11, 237\u2013243 (1974).","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02248695_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/363067.363115","volume":"10","author":"L. W. Ehrlich","year":"1967","unstructured":"Ehrlich, L. W.: A modified Newton method for polynomials. Comm. ACM10, 107\u2013108 (1967).","journal-title":"Comm. ACM"},{"key":"BF02248695_CR4","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1137\/0715032","volume":"15","author":"I. Gargantini","year":"1978","unstructured":"Gargantini, I.: Further applications of circular arithmetic: Schroeder-like algorithms with error bounds for finding zeros of polynomials. SIAM J. Numer. Anal.15, 497\u2013510 (1978).","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02248695_CR5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01396176","volume":"27","author":"E. Hansen","year":"1977","unstructured":"Hansen, E., Patrick, M.: A family of root finding methods. Numer. Math.27, 257\u2013269 (1977).","journal-title":"Numer. Math."},{"key":"BF02248695_CR6","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/BF01600333","volume":"5","author":"V. H. Maehly","year":"1954","unstructured":"Maehly, V. H.: Zur iterativen Aufl\u00f6sung algebraischer Gleichungen. Z. Angew. Math. Phys.5, 260\u2013263 (1954).","journal-title":"Z. Angew. Math. Phys."},{"key":"BF02248695_CR7","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02280787","volume":"30","author":"G. V. Milovanovi\u0107","year":"1983","unstructured":"Milovanovi\u0107, G. V., Petkovi\u0107, M. S.: On the convergence order of a modified method for simultaneous finding polynomial zeros. Computing30, 171\u2013178 (1983).","journal-title":"Computing"},{"key":"BF02248695_CR8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1080\/00207167708803141","volume":"6","author":"A. W. M. Nourein","year":"1977","unstructured":"Nourein, A. W. M.: An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial. Intern. J. Computer Math.6, 241\u2013252 (1977).","journal-title":"Intern. J. Computer Math."},{"key":"BF02248695_CR9","volume-title":"Iterative solution of nonlinear equations in several variables","author":"J. M. Ortega","year":"1970","unstructured":"Ortega, J. M., Rheinboldt, W. C.: Iterative solution of nonlinear equations in several variables. New York: Academic Press 1970."},{"key":"BF02248695_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0083599","volume-title":"Iterative methods for simultaneous inclusion of polynomial zeros","author":"M. S. Petkovi\u0107","year":"1989","unstructured":"Petkovi\u0107, M. S.: Iterative methods for simultaneous inclusion of polynomial zeros. Berlin: Springer 1989."},{"key":"BF02248695_CR11","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1016\/0898-1221(86)90020-9","volume":"12","author":"M. S. Petkovi\u0107","year":"1986","unstructured":"Petkovi\u0107, M. S., Milovanovi\u0107, G. V., Stefanovi\u0107, L. V.: On some higher-order methods for the simultaneous approximation of multiple polynomial zeros. Comput. Math. Appl.12, 951\u2013962 (1986).","journal-title":"Comput. Math. Appl."},{"key":"BF02248695_CR12","unstructured":"Petkovi\u0107, M. S., Stefanovi\u0107, L. V., Marjanovi\u0107, Z. M.: A family of simultaneous zero finding methods. Intern. J. Computer Math (to appear)."},{"key":"BF02248695_CR13","unstructured":"Sakurai, T., Tori, T., Sugiura, H.: A higher order iteration formula for simultaneous determination of zeros of a polynomial (submitted for publication)."},{"key":"BF02248695_CR14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01444024","volume":"2","author":"E. Schr\u00f6der","year":"1870","unstructured":"Schr\u00f6der, E.: \u00dcber unendlich viele Algorithmen zur Aufl\u00f6sung der Gleichungen. Math. Ann.2, 317\u2013365 (1870).","journal-title":"Math. Ann."},{"key":"BF02248695_CR15","volume-title":"Matrix iterative analysis","author":"R. S. Varga","year":"1962","unstructured":"Varga, R. S.: Matrix iterative analysis. Englewood Cliffs, New Jersey: Prentice Hall 1962."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02248695.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02248695\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02248695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T10:41:30Z","timestamp":1558003290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02248695"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02248695"],"URL":"https:\/\/doi.org\/10.1007\/bf02248695","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}