Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
On the rate of convergence of 2-term recursions in Rd
Rocha L. Computing59 (3):187-207,1997.Type:Article
Date Reviewed: Jun 1 1998

Rocha presents a strange but intriguing convergence theorem for an iterative process of the form x n + 2 = &fgr; ( x n + 1 , xn ), for given x0 and x1, with xn → &xgr; such that &xgr; = &fgr; ( &xgr; , &xgr; ). Unfortunately, the result is nonintuitive and unmotivated, and the presentation leaves something to be desired. The only example, or proposed application, is to the degenerate case of two interleaved Newton iterant sequences with initial iterants x0 and x1. The even and odd subsequences converge quadratically; the theorem connects the rate of convergence of the two subsequences relative to one another.

Reviewer:  Donald G. M. Anderson Review #: CR121592 (9806-0436)
Bookmark and Share
 
Roots Of Nonlinear Equations (G.1.5 )
 
Would you recommend this review?
yes
no
Other reviews under "Roots Of Nonlinear Equations": Date
On the algebraic complexity of rational iteration procedures
Baur W. Theoretical Computer Science 88(2): 313-324, 1991. Type: Article
Oct 1 1992
An efficiently implementable Gauss-Newton-like method for solving singular nonlinear equations
Hoy A. Computing 41(1-2): 107-122, 1989. Type: Article
Sep 1 1989
Regularization and computation of a bifurcation problem with Corank 2
Böhmer K., Zhen M. Computing 41(4): 307-316, 1989. Type: Article
Jun 1 1990
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy