{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T21:33:26Z","timestamp":1769808806545,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":[[1990,12]]},"DOI":"10.1007\/bf02238803","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T17:20:39Z","timestamp":1131988839000},"page":"355-367","source":"Crossref","is-referenced-by-count":156,"title":["Recurrence relations for rational cubic methods II: The Chebyshev method","Rekursions-Beziehungen f\u00fcr rationale kubische Verfahren II: Die Chebyshev Methode"],"prefix":"10.1007","volume":"45","author":[{"given":"V.","family":"Candela","sequence":"first","affiliation":[]},{"given":"A.","family":"Marquina","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02238803_CR1","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1080\/00029890.1981.11995308","volume":"88","author":"G. Alefeld","year":"1981","unstructured":"Alefeld, G., On the convergence of Halley's method. Amer. Math. Monthly,88, 530\u2013536 (1981).","journal-title":"Amer. Math. Monthly"},{"key":"BF02238803_CR2","first-page":"62","volume":"IX","author":"M. Altman","year":"1961","unstructured":"Altman, M., Iterative methods of higher order. Bull. Acad. Pollon., Sci. (S\u00e9rie des sci. math., astr., phys.),IX, 62\u201368 (1961).","journal-title":"Bull. Acad. Pollon., Sci. (S\u00e9rie des sci. math., astr., phys.)"},{"issue":"4","key":"BF02238803_CR3","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1137\/1030134","volume":"30","author":"J. M. Borwein","year":"1988","unstructured":"Borwein, J. M., Borwein, P. B., On the complexity of familiar functions and numbers. SIAM Rev.30, 4, 589\u2013601 (1988).","journal-title":"SIAM Rev."},{"key":"BF02238803_CR4","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1109\/T-C.1970.223027","volume":"19","author":"R. Brent","year":"1970","unstructured":"Brent, R., On the addition of binary numbers. IEEE Trans. on Comp.,C-19, 758\u2013759 (1970).","journal-title":"IEEE Trans. on Comp., C"},{"issue":"2","key":"BF02238803_CR5","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/321941.321944","volume":"23","author":"R. Brent","year":"1976","unstructured":"Brent, R., Fast multiple-precision evaluation of elementary functions. J. of the Association for Computing Machinery,23, 2, 242\u2013251 (1976).","journal-title":"J. of the Association for Computing Machinery"},{"key":"BF02238803_CR6","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1080\/00029890.1977.11994468","volume":"84","author":"G. H. Brown","year":"1977","unstructured":"Brown, G. H., On Halley's variation of Newton's Method. Amer. Math. Monthly,84, 726\u2013727 (1977).","journal-title":"Amer. Math. Monthly"},{"key":"BF02238803_CR7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02241866","volume":"44","author":"V. F. Candela","year":"1990","unstructured":"Candela, V. F., Marquina, A., Recurrence relations, for rational cubic methods I: the Halley method. Computing44, 169\u2013184 (1990).","journal-title":"Computing"},{"key":"BF02238803_CR8","doi-asserted-by":"crossref","first-page":"418","DOI":"10.21136\/AM.1970.103316","volume":"15","author":"B. D\u00f6ring","year":"1970","unstructured":"D\u00f6ring, B., Einige S\u00e4tze \u00fcber das Verfahren der tangierenden Hyperbeln in Banach-R\u00e4umen. Aplikace Mat.,15, 418\u2013464 (1970).","journal-title":"Aplikace Mat."},{"key":"BF02238803_CR9","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00281379","volume":"4","author":"H. Ehrmann","year":"1959","unstructured":"Ehrmann, H., Konstruktion und Durchf\u00fcrung von Iterationsverfahren h\u00f6herer Ordnung. Arch. Rational Mech. Anal.,4, 65\u201388 (1959).","journal-title":"Arch. Rational Mech. Anal."},{"key":"BF02238803_CR10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1080\/00029890.1985.11971554","volume":"92","author":"W. Gander","year":"1985","unstructured":"Gander, W., On Halley's iteration method. Amer. Math. Monthly,92, 131\u2013134 (1985).","journal-title":"Amer. Math. Monthly"},{"key":"BF02238803_CR11","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":"BF02238803_CR12","volume-title":"Functional analysis in normed spaces","author":"L. V. Kantorovich","year":"1964","unstructured":"Kantorovich, L. V., Akilov, G. P., Functional analysis in normed spaces. Ex. Oxford: Pergamon 1964."},{"key":"BF02238803_CR13","volume-title":"Seminumerical algorithms","author":"D. Knuth","year":"1981","unstructured":"Knuth, D., Seminumerical algorithms, 2nd edn. Reading. Mass. Addison Wesley (1981).","edition":"2nd edn"},{"issue":"3","key":"BF02238803_CR14","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/T-C.1970.222901","volume":"19","author":"E. V. Krishnamurthy","year":"1970","unstructured":"Krishnamurthy, E. V., On optimal iterative schemes for high-speed division. IEEE Trans. on Comp.,C-19, 3, 227\u2013231 (1970).","journal-title":"IEEE Trans. on Comp., C"},{"key":"BF02238803_CR15","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1080\/00029890.1979.11994773","volume":"86","author":"G. J. Miel","year":"1979","unstructured":"Miel, G. J. The Kantorovich Theorem with optimal error bounds., Amer. Math. Monthly,86, 212\u2013215 (1979).","journal-title":"Amer. Math. Monthly"},{"key":"BF02238803_CR16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02237981","volume":"27","author":"G. J. Miel","year":"1981","unstructured":"Miel, G. J., An updated version of the Kantorovich theorem for Newton's method. Computing,27, 237\u2013244 (1981).","journal-title":"Computing"},{"key":"BF02238803_CR17","doi-asserted-by":"crossref","first-page":"658","DOI":"10.2307\/2313800","volume":"75","author":"J. M. Ortega","year":"1968","unstructured":"Ortega, J. M., The Newton-Kantorovich theorem. Amer. Math. Monthly,75, 658\u2013660 (1968).","journal-title":"Amer. Math. Monthly"},{"key":"BF02238803_CR18","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":"BF02238803_CR19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01463998","volume":"34","author":"F. A. Potra","year":"1980","unstructured":"Potra, F. A., Pt\u00e1k, V., Sharp error bounds for Newton's process. Numer. Math.,34, 63\u201372 (1980).","journal-title":"Numer. Math."},{"key":"BF02238803_CR20","volume-title":"Nondiscrete induction and iterative processes. Research Notes in Mathematics","author":"F. A. Potra","year":"1984","unstructured":"Potra, F. A., Pt\u00e1k, V., Nondiscrete induction and iterative processes. Research Notes in Mathematics,103 Ed. Boston: Pitman 1984.","edition":"103 Ed."},{"key":"BF02238803_CR21","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1080\/00029890.1971.11992771","volume":"78","author":"R. A. Tapia","year":"1971","unstructured":"Tapia, R. A., The Kantorovich theorem for Newton's method. Amer. Math. Monthly,78, 389\u2013392 (1971).","journal-title":"Amer. Math. Monthly"},{"key":"BF02238803_CR22","volume-title":"Introduction to functional analysis","author":"A. Y. Taylor","year":"1980","unstructured":"Taylor, A. Y., Lay, D., Introduction to functional analysis, 2nd edn. New York: J. Wiley, 1980.","edition":"2nd edn"},{"key":"BF02238803_CR23","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01389624","volume":"49","author":"T. Yamamoto","year":"1986","unstructured":"Yamamoto, T., A method for finding sharp error bounds for Newton's Method under the Kantorovich Assumptions. Numer. Math.,49, 203\u2013220 (1986).","journal-title":"Numer. Math."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238803.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02238803\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238803","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T17:20:21Z","timestamp":1626715221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02238803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["BF02238803"],"URL":"https:\/\/doi.org\/10.1007\/bf02238803","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}