6533b873fe1ef96bd12d4ae5
RESEARCH PRODUCT
Recurrence relations for rational cubic methods I: The Halley method
V. CandelaA. Marqunasubject
Numerical AnalysisRecurrence relationDegree (graph theory)Iterative methodMathematical analysisBanach spaceComputer Science ApplicationsTheoretical Computer ScienceComputational Mathematicssymbols.namesakeComputational Theory and MathematicsIterated functionHalley's methodConvergence (routing)symbolsApplied mathematicsNewton's methodSoftwareMathematicsdescription
In this paper we present a system of a priori error bounds for the Halley method in Banach spaces. Our theorem supplies sufficient conditions on the initial point to ensure the convergence of Halley iterates, by means of a system of “recurrence relations”, analogous to those given for the Newton method by Kantorovich, improving previous results by Doring [4]. The error bounds presented are optimal for second degree polynomials. Other rational cubic methods, as the Chebyshev method, will be treated in a subsequent paper.
year | journal | country | edition | language |
---|---|---|---|---|
1990-06-01 | Computing |