Recurrence Relations for Chebyshev-Type Methods
Journal Article
·
· Applied Mathematics and Optimization
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 Frechet 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.
- OSTI ID:
- 21067529
- Journal Information:
- Applied Mathematics and Optimization, Vol. 41, Issue 2; Other Information: DOI: 10.1007/s002459911012; Copyright (c) 2000 Springer-Verlag New York Inc.; Article Copyright (c) Inc. 2000 Springer-Verlag New York; Country of input: International Atomic Energy Agency (IAEA); ISSN 0095-4616
- Country of Publication:
- United States
- Language:
- English
Similar Records
An efficient Chebyshev-Lanczos method for obtaining eigensolutions of the schroedinger equation on a grid
Sequential quadratic programming algorithms for optimization
A unified approach for constructing fast two-step methods in Banach space and their applications
Journal Article
·
Mon Jul 01 00:00:00 EDT 1996
· Journal of Computational Physics
·
OSTI ID:21067529
+1 more
Sequential quadratic programming algorithms for optimization
Technical Report
·
Tue Aug 01 00:00:00 EDT 1989
·
OSTI ID:21067529
A unified approach for constructing fast two-step methods in Banach space and their applications
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:21067529