Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

A Modification of Inclusion of a Zero of a Function Using Interval Method

Nor Aliza Abd Rahmin, and Mansor Monsi, and Malik Hj. Abu Hassan, and Fudziah Ismail, (2009) A Modification of Inclusion of a Zero of a Function Using Interval Method. Malaysian Journal of Mathematical Sciences, 3 (1). pp. 67-82. ISSN 1823 8343

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
145Kb

Official URL: http://www.inform.upm.edu.my/journal/fullpaper/vol3no1/6.%20MJMS%20Vol%203%20(1)%20page%2067-82.pdf

Affiliations

Universiti Putra Malaysia, Faculty of Science, Dept. of Mathematics
Universiti Putra Malaysia, Faculty of Science, Dept. of Mathematics
Universiti Putra Malaysia, Faculty of Science, Dept. of Mathematics
Universiti Putra Malaysia, Faculty of Science, Dept. of Mathematics

Abstract

Interval method is used for the inclusion of a zero of a function. The Ehrman (EHR) method considers the Newton’s iteration in finding the root of a function. This method is modified by using the mid point in the procedure and improved method has a faster convergence rate and less processing time. In this paper, the convergence analysis and the numerical results are shown.

Item Type:Journal
Keywords:Interval analysis; zero of a function; inclusion; CPU time; a rate of convergence
Subjects:Q Science, Computer Science
ID Code:7794

1. Aberth, O. 1973. Iteration methods for finding all zeros of polynomial simultaneously. Math Comp, 27, 339-344.

2. Alefeld, G. and Herzberger, J. 1974. On the convergence speed of some algorithms for the simultaneous approximation of polynomial roots. SIAM J. Numer. Anal, 11, 237-243.

3. Alefeld, G. and Herzberger, J. 1983. Introduction to Interval Computation. New York: Academic Press.

4. Braess, D. and Hadeler, K.P. 1973. Simultaneous Inclusion of the zeroes of polynomial. Numer: Math, 21, 161-165.

5. Caprani, O. and Madsen, K. 1978. Iterative methods for interval inclusion of fixed points. BIT 18, 42-51.

6. H. Ehrmann, Konstruktion und Durchfuhrung von Iterations verfahren hoheser Ordnung, Arch, Rational Mech. Anal. 4(1959) 65 – 88.

7. Ehrlic, L.W. 1967. A Modified Newton method for polynomials. Comm. ACM. 10, 107-108.

8. Ely, J.S. 1993. The VPI Software Package for Variable Precision Interval Computations., 2, pp. 135-153.

9. Gargantini, I. 1978. Further applications circular arithmetic: Shroeder-like algorithms with error bounds for finding zeroes of polynomial. SIAM. J. Numer. Anal. 15,149-154

10. Hansen, E. 1978. Interval forms of Newton’s method. Computing. 20, 153-163.

Repository Staff Only: item control page
 
 
 
 
 
 
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.