List of Journals    /    Call For Papers    /    Subscriptions    /    Login
 
 
 
 
 SEARCH
By Author By Title
 
 
ABOUT CSC
 About CSC Journals
 CSC Journals Objectives
 List of Journals
 CALL FOR PAPERS
 Call For Papers CFP
 Special Issue CFP
AUTHOR GUIDELINES
 Submission Guidelines
 Peer Review Process
 Helpful Hints For Getting Published
 Plagiarism Policies
 Abstracting & Indexing
 Open Access Policy
 Submit Manuscript
 FOR REVIEWERS
 Reviewer Guidelines
 FOR EDITORIAL
 Editor Guidelines
 Join Us As Editor
 Launch Special Issue
 Suggest New Journal
 CSC LIBRARY
 Browse CSC Library
 Open Access Policy
  SERVICES
 Conference Partnership Program (CPP)
 Abstracting & Indexing
 SUBSCRIPTIONS
 Subscriptions
 Discounted Packages
 Archival Subscriptions
 How to Subscribe
 Librarians
 Subscriptions Agents
 Order Form
 DOWNLOADS
 
 
 
 
An Improvement to the Brent’s Method
Full text
 PDF(74.6KB)
Source 
International Journal of Experimental Algorithms (IJEA)
Table of Contents
Download Complete Issue    PDF(0 Bytes)
Volume:  2    Issue:  1
Pages:  NULL
Publication Date:   March / April 2011
ISSN (Online): 2180-1282
Pages 
21 - 26
Author(s)  
Zhengqiu Zhang - China
 
Published Date   
31-05-2011 
Publisher 
CSC Journals, Kuala Lumpur, Malaysia
ADDITIONAL INFORMATION
Keywords   Abstract   References   Cited by   Related Articles   Collaborative Colleague
 
KEYWORDS:   Brent’s Method, Simplification, Improvement 
 
 
No record found
 
 
This study presents an improvement to the Brent¡¯s Method by reconstruction. The Brent¡¯s Method determines the next iteration interval from two subsections, whereas the new method determines the next iteration interval from three subsections constructed by four given points and thus can greatly reduce the iteration interval length. The new method not only gets more readable but also converges faster. An experiment is made to investigate its performance. Results show that, after simplification, the computational efficiency can greatly be improved.  
 
 
 
1 Brent, R.P., Algorithms for Minimization without Derivatives, Chapter 4. Prentice- Hall, Englewood Cliffs, NJ. ISBN 0-13-022335-2,1973.
2 Antia,H.M., Numerical Methods for Scientists and Engineers, Birkhäuser, 2002, pp.362-365,2 ed.
3 Dekker, T. J. Finding a zero by means of successive linear interpolation, In B. Dejon and P. Henrici (eds), Constructive Aspects of the Fundamental Theorem of Algebra, Wiley- Interscience, London, SBN 471-28300-9,1969.
4 Alfio Quarteroni, Fausto Saleri. Scientific Computing with MATLAB (Texts in Computational Science and Engineering 2), Springer, 2003, pp.52.
5 William H. Press, Saul A. Teukolsky, William T. Vetterling and Brian P. Flannery. Numerical Recipes in C, The Art of Scientific Computing Second Edition, Cambridge University Press, November 27, 1992, pp. 358–362.
6 Ridders, C.J.F. “ Three-point iterations derived from exponential curve fitting ”, IEEE Transactions on Circuits and Systems 26 (8): 669-670,1979.
7 Jaan Kiusalaas. Numerical Methods in Engineering with Python, 2nd Edition, Cambridge University Press, 2010.
8 Wikipedia contributors. “ Brent's method. Wikipedia ”, The Free Encyclopedia. Wikipedia, The Free Encyclopedia, 13 Apr. 2010. Web. 13 May. 2010.
9 Press, W.H.; S.A. Teukolsky, W.T. Vetterling, B.P. Flannery. Numerical Recipes in C: The Art of Scientific Computing (2nd ed.). Cambridge UK: Cambridge University Press.1992, pp. 358–359.
 
 
 
 
 
 
 
 
Zhengqiu Zhang : Colleagues  
 
 
 
  Untitled Document
 
Copyrights (c) 2012 Computer Science Journals. All rights reserved.
Best viewed at 1152 x 864 resolution. Microsoft Internet Explorer.
 
  
 
Copyrights & Usage: Articles published by CSC Journals are Open Access. Permission to copy and distribute any other content, images, animation and other parts of this website is prohibited. CSC Journals has the rights to take action against individual/group if they are found victim of copying these parts of the website.