{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:53:46Z","timestamp":1649116426643},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,2,12]],"date-time":"2010-02-12T00:00:00Z","timestamp":1265932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s11075-010-9368-y","type":"journal-article","created":{"date-parts":[[2010,2,10]],"date-time":"2010-02-10T23:05:37Z","timestamp":1265843137000},"page":"503-528","source":"Crossref","is-referenced-by-count":13,"title":["A convergence analysis for directional two-step Newton methods"],"prefix":"10.1007","volume":"55","author":[{"given":"Ioannis K.","family":"Argyros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sa\u00efd","family":"Hilout","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,12]]},"reference":[{"key":"9368_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01292765","volume":"119","author":"IK Argyros","year":"1995","unstructured":"Argyros, I.K.: A unified approach for constructing fast two-step Newton-like methods. Monatsh. Math. 119, 1\u201322 (1995)","journal-title":"Monatsh. Math."},{"key":"9368_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.4064\/am32-1-3","volume":"32","author":"IK Argyros","year":"2005","unstructured":"Argyros, I.K.: A convergence analysis of Newton-like methods for singular equations using outer or generalized inverses. Appl. Math. (Warsaw) 32, 37\u201349 (2005)","journal-title":"Appl. Math. (Warsaw)"},{"key":"9368_CR3","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.jmaa.2004.04.008","volume":"298","author":"IK Argyros","year":"2004","unstructured":"Argyros, I.K.: A unifying local\u2013semilocal convergence analysis and applications for two-point Newton-like methods in Banach space. J. Math. Anal. Appl. 298, 374\u2013397 (2004)","journal-title":"J. Math. Anal. Appl."},{"key":"9368_CR4","volume-title":"Series: Studies in Computational Mathematics, 15","author":"IK Argyros","year":"2007","unstructured":"Argyros, I.K.: Computational theory of iterative methods. In: Chui, C.K., Wuytack, L. (eds.) Series: Studies in Computational Mathematics, 15. Elsevier, New York (2007)"},{"key":"9368_CR5","doi-asserted-by":"crossref","unstructured":"Argyros, I.K.: A semilocal convergence analysis for directional Newton methods. Math. Comput. A.M.S. (2010, in press)","DOI":"10.1090\/S0025-5718-2010-02398-1"},{"key":"9368_CR6","volume-title":"Efficient Methods for Solving Equations and Variational Inequalities","author":"IK Argyros","year":"2009","unstructured":"Argyros, I.K., Hilout, S.: Efficient Methods for Solving Equations and Variational Inequalities. Polimetrica, Milan (2009)"},{"key":"9368_CR7","first-page":"119","volume":"4","author":"IK Argyros","year":"2009","unstructured":"Argyros, I.K., Hilout, S.: Enclosing roots of polynomial equations and their applications to iterative processes. Surveys Math. Appl. 4, 119\u2013132 (2009)","journal-title":"Surveys Math. Appl."},{"key":"9368_CR8","unstructured":"Ben-Israel, A., Levin, Y.: Maple programs for directional Newton methods. Available at ftp:\/\/rutcor.rutgers.edu\/pub\/bisrael\/Newton-Dir.mws"},{"key":"9368_CR9","first-page":"251","volume":"237","author":"Y Levin","year":"2002","unstructured":"Levin, Y., Ben-Israel, A.: Directional Newton methods in n variables. Math Comput A.M.S. 237, 251\u2013262 (2002)","journal-title":"Math Comput A.M.S."},{"key":"9368_CR10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s002459911012","volume":"41","author":"JA Ezquerro","year":"2000","unstructured":"Ezquerro, J.A., Hern\u00e1ndez, M.A.: Recurrence relations for Chebyshev-type methods. Appl. Math. Optim. 41, 227\u2013236 (2000)","journal-title":"Appl. Math. Optim."},{"key":"9368_CR11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10543-009-0226-z","volume":"49","author":"JA Ezquerro","year":"2009","unstructured":"Ezquerro, J.A., Hern\u00e1ndez, M.A.: New iterations of R-order four with reduced computational cost. BIT Numer. Math. 49, 325\u2013342 (2009)","journal-title":"BIT Numer. Math."},{"key":"9368_CR12","first-page":"1","volume":"36","author":"MA Hern\u00e1ndez","year":"1998","unstructured":"Hern\u00e1ndez, M.A., Rubio, M.J.: Recurrence relations for the super-Halley method. Comput. Math. Appl. 36, 1\u20138 (1998)","journal-title":"Comput. Math. Appl."},{"key":"9368_CR13","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic, New York (1970)"},{"key":"9368_CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1137\/0704003","volume":"4","author":"V Pereyra","year":"1967","unstructured":"Pereyra, V.: Iterative methods for solving nonlinear least square problems. SIAM J. Numer. Anal. 4, 27\u201336 (1967)","journal-title":"SIAM J. Numer. Anal."},{"key":"9368_CR15","series-title":"Translations Series in Mathematics and Engineering","volume-title":"Introduction to optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to optimization. Translated from the Russian. With a foreword by D.P. Bertsekas. Translations Series in Mathematics and Engineering. Optimization Software, Inc., Publications Division, New York (1987)"},{"key":"9368_CR16","volume-title":"A First Course in Numerical Analysis","author":"A Ralston","year":"1978","unstructured":"Ralston, A., Rabinowitz, P.: A First Course in Numerical Analysis, 2nd edn. McGraw-Hill, New York (1978)","edition":"2"},{"key":"9368_CR17","volume-title":"Introduction to Numerical Analysis","author":"J Stoer","year":"1976","unstructured":"Stoer, J., Bulirsch, K.: Introduction to Numerical Analysis. Springer, Berlin (1976)"},{"key":"9368_CR18","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1137\/0727071","volume":"27","author":"HF Walker","year":"1990","unstructured":"Walker, H.F., Watson, L.T.: Least-change Secant update methods. SIAM J. Numer. Anal. 27, 1227\u20131262 (1990)","journal-title":"SIAM J. Numer. Anal."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-010-9368-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-010-9368-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-010-9368-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:08:14Z","timestamp":1559351294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-010-9368-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,12]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["9368"],"URL":"https:\/\/doi.org\/10.1007\/s11075-010-9368-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,12]]}}}