Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Recurrence Relations for Chebyshev-Type Methods

Recurrence Relations for Chebyshev-Type Methods Abstract. The convergence of new second-order iterative methods are analyzed in Banach spaces by introducing a system of recurrence relations. A system of a priori error bounds for that method is also provided. The methods are defined by using a constant bilinear operator A , instead of the second Fréchet derivative appearing in the defining formula of the Chebyshev method. Numerical evidence that the methods introduced here accelerate the classical Newton iteration for a suitable A is provided. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Mathematics and Optimization Springer Journals

Recurrence Relations for Chebyshev-Type Methods

Loading next page...
 
/lp/springer-journals/recurrence-relations-for-chebyshev-type-methods-t2TV8v4d9y

References (7)

Publisher
Springer Journals
Copyright
2000 Springer-Verlag New York Inc.
Subject
Mathematics; Calculus of Variations and Optimal Control; Optimization; Systems Theory, Control; Theoretical, Mathematical and Computational Physics; Mathematical Methods in Physics; Numerical and Computational Physics, Simulation
ISSN
0095-4616
eISSN
1432-0606
DOI
10.1007/s002459911012
Publisher site
See Article on Publisher Site

Abstract

Abstract. The convergence of new second-order iterative methods are analyzed in Banach spaces by introducing a system of recurrence relations. A system of a priori error bounds for that method is also provided. The methods are defined by using a constant bilinear operator A , instead of the second Fréchet derivative appearing in the defining formula of the Chebyshev method. Numerical evidence that the methods introduced here accelerate the classical Newton iteration for a suitable A is provided.

Journal

Applied Mathematics and OptimizationSpringer Journals

Published: Apr 1, 2000

There are no references for this article.