{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T05:19:55Z","timestamp":1726463995469},"reference-count":29,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2723,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Mathematics with Applications"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1016\/j.camwa.2005.07.018","type":"journal-article","created":{"date-parts":[[2006,5,23]],"date-time":"2006-05-23T16:50:00Z","timestamp":1148403000000},"page":"605-620","source":"Crossref","is-referenced-by-count":6,"title":["Method for finding multiple roots of polynomials"],"prefix":"10.1016","volume":"51","author":[{"given":"Chang-Dau","family":"Yan","sequence":"first","affiliation":[]},{"given":"Wei-Hua","family":"Chieng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.camwa.2005.07.018_bib1_1","first-page":"131","article-title":"Modern Computer Algebra","author":"von zur Gathen","year":"1999"},{"key":"10.1016\/j.camwa.2005.07.018_bib1_2","first-page":"147","article-title":"Modern Computer Algebra","author":"von zur Gathen","year":"1999"},{"key":"10.1016\/j.camwa.2005.07.018_bib2","first-page":"38","article-title":"Applied Numerical Analysis","author":"Gerald","year":"1999"},{"key":"10.1016\/j.camwa.2005.07.018_bib3","first-page":"66","article-title":"Applied Numerical Methods for Digital Computation","author":"James","year":"1993"},{"key":"10.1016\/j.camwa.2005.07.018_bib4_1","first-page":"41","article-title":"Numerical Analysis: A Practical Approach","author":"Maron","year":"1987"},{"key":"10.1016\/j.camwa.2005.07.018_bib4_2","first-page":"61","article-title":"Numerical Analysis: A Practical Approach","author":"Maron","year":"1987"},{"key":"10.1016\/j.camwa.2005.07.018_bib5","first-page":"40","article-title":"Numerical Methods Using Matlab","author":"Mathews","year":"1999"},{"first-page":"7","year":"1997","author":"Ueberhuber","key":"10.1016\/j.camwa.2005.07.018_bib6_1"},{"first-page":"296","year":"1997","author":"Ueberhuber","key":"10.1016\/j.camwa.2005.07.018_bib6_2"},{"issue":"2","key":"10.1016\/j.camwa.2005.07.018_bib7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/S0036144595288554","article-title":"Solving a polynomial equation: Some history and recent progress","volume":"39","author":"Pan","year":"1997","journal-title":"SIAM Review"},{"issue":"3","key":"10.1016\/j.camwa.2005.07.018_bib8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/232826.232830","article-title":"The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence","volume":"22","author":"Hull","year":"1996","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/j.camwa.2005.07.018_bib9","series-title":"Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation","first-page":"121","article-title":"Polynomial root finding using iterated eigenvalue computation","author":"Fortune","year":"2001"},{"issue":"1","key":"10.1016\/j.camwa.2005.07.018_bib10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0898-1221(94)00202-V","article-title":"Polynomial zerofinding iterative matrix algorithms","volume":"29","author":"Malek","year":"1995","journal-title":"Computers Math. Applic."},{"issue":"2","key":"10.1016\/j.camwa.2005.07.018_bib11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0898-1221(95)00076-B","article-title":"A composite polynomial zerofinding matrix algorithm","volume":"30","author":"Malek","year":"1995","journal-title":"Computers Math. Applic."},{"key":"10.1016\/j.camwa.2005.07.018_bib12_1","first-page":"31","article-title":"Calculus","author":"Bradley","year":"1999"},{"key":"10.1016\/j.camwa.2005.07.018_bib12_2","first-page":"145","article-title":"Calculus","author":"Bradley","year":"1999"},{"key":"10.1016\/j.camwa.2005.07.018_bib12_3","first-page":"301","article-title":"Calculus","author":"Bradley","year":"1999"},{"key":"10.1016\/j.camwa.2005.07.018_bib13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/inco.2001.3032","article-title":"Computation of approximate polynomial GCDs and an extension","volume":"167","author":"Pan","year":"2001","journal-title":"Information and Computation"},{"first-page":"18","year":"1994","author":"Bini","key":"10.1016\/j.camwa.2005.07.018_bib14_1"},{"first-page":"90","year":"1994","author":"Bini","key":"10.1016\/j.camwa.2005.07.018_bib14_2"},{"first-page":"399","year":"1981","author":"Knuth","key":"10.1016\/j.camwa.2005.07.018_bib15"},{"issue":"4","key":"10.1016\/j.camwa.2005.07.018_bib16","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1145\/321662.321664","article-title":"On Euclid's algorithm and the computation of polynomial greatest common divisors'","volume":"18","author":"Brown","year":"1971","journal-title":"Journal of Association for Computing Machinery"},{"key":"10.1016\/j.camwa.2005.07.018_bib17","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0022-4049(97)00013-3","article-title":"Certified approximate univariate GCDs","volume":"117 & 118","author":"Emiris","year":"1997","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/j.camwa.2005.07.018_bib18_1","first-page":"185","article-title":"The Student Edition of Matlab, Version 4, User's Guide","author":"MathWorks Inc.","year":"1995"},{"key":"10.1016\/j.camwa.2005.07.018_bib18_2","first-page":"559","article-title":"The Student Edition of Matlab, Version 4, User's Guide","author":"MathWorks Inc.","year":"1995"},{"key":"10.1016\/j.camwa.2005.07.018_bib19_1","first-page":"85","article-title":"The Mathematica Book","author":"Wolfram","year":"1996"},{"key":"10.1016\/j.camwa.2005.07.018_bib19_2","first-page":"99","article-title":"The Mathematica Book","author":"Wolfram","year":"1996"},{"key":"10.1016\/j.camwa.2005.07.018_bib19_3","first-page":"786","article-title":"The Mathematica Book","author":"Wolfram","year":"1996"},{"issue":"1","key":"10.1016\/j.camwa.2005.07.018_bib20","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/355626.355632","article-title":"Principles for testing polynomial zerofinding programs","volume":"1","author":"Jenkins","year":"1975","journal-title":"ACM Transactions on Mathematical Software"}],"container-title":["Computers & Mathematics with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0898122105005250?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0898122105005250?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T05:24:12Z","timestamp":1547616252000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0898122105005250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":29,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["S0898122105005250"],"URL":"https:\/\/doi.org\/10.1016\/j.camwa.2005.07.018","relation":{},"ISSN":["0898-1221"],"issn-type":[{"type":"print","value":"0898-1221"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}