Modified algorithms in interval symmetric single-step procedure for simultaneous inclusion of polynomial zeros

Several modifications have been introduced in order to improve the problems in finding the zeros of polynomial simultaneously. They are named as Interval Symmetric Single-step 5-Delta procedure (ISS1-5D), Interval Midpoint Symmetric Single-step 5-Delta procedure (IMSS1-5D), Interval Zoro Symmetric S...

Full description

Saved in:
Bibliographic Details
Main Author: Wan Mohd Sham, Atiyah
Format: Thesis
Language:English
Published: 2014
Online Access:http://psasir.upm.edu.my/id/eprint/55687/1/FS%202014%2038RR.pdf
http://psasir.upm.edu.my/id/eprint/55687/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.55687
record_format eprints
spelling my.upm.eprints.556872017-06-07T02:43:52Z http://psasir.upm.edu.my/id/eprint/55687/ Modified algorithms in interval symmetric single-step procedure for simultaneous inclusion of polynomial zeros Wan Mohd Sham, Atiyah Several modifications have been introduced in order to improve the problems in finding the zeros of polynomial simultaneously. They are named as Interval Symmetric Single-step 5-Delta procedure (ISS1-5D), Interval Midpoint Symmetric Single-step 5-Delta procedure (IMSS1-5D), Interval Zoro Symmetric Single-step 5-Delta procedure (IZSS1-5D) and Interval Midpoint Zoro Symmetric Single-step 5-Delta procedure (IMZSS1-5D) which were explained in details in this thesis. These four new procedures have been established from the previous symmetric single-step procedure. Furthermore, we ensure that we start by choosing the suitable initial disjoint intervals which are guaranteed to contain one zero inside of each interval. The numerical results are given to validate the new modifications and the performances are being compared with the existing procedures in terms of number of iteration and computational time (CPU times). In addition, the convergence properties for all new modifications are investigated to ensure that the procedures are useful for finding the zeros of polynomial. The convergence analysis of each procedure is also discussed. The programming codes are developed and implemented using Matlab R2012b incorporated with Intlab V5.5 toolbox and compared with the existing procedures. The efficiency of the procedures is justified by the numerical results given. The results generated showed that these new procedures produced less computational time, higher rate of convergence and achieved the desired accuracy. 2014-01 Thesis NonPeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/55687/1/FS%202014%2038RR.pdf Wan Mohd Sham, Atiyah (2014) Modified algorithms in interval symmetric single-step procedure for simultaneous inclusion of polynomial zeros. Masters thesis, Universiti Putra Malaysia.
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
description Several modifications have been introduced in order to improve the problems in finding the zeros of polynomial simultaneously. They are named as Interval Symmetric Single-step 5-Delta procedure (ISS1-5D), Interval Midpoint Symmetric Single-step 5-Delta procedure (IMSS1-5D), Interval Zoro Symmetric Single-step 5-Delta procedure (IZSS1-5D) and Interval Midpoint Zoro Symmetric Single-step 5-Delta procedure (IMZSS1-5D) which were explained in details in this thesis. These four new procedures have been established from the previous symmetric single-step procedure. Furthermore, we ensure that we start by choosing the suitable initial disjoint intervals which are guaranteed to contain one zero inside of each interval. The numerical results are given to validate the new modifications and the performances are being compared with the existing procedures in terms of number of iteration and computational time (CPU times). In addition, the convergence properties for all new modifications are investigated to ensure that the procedures are useful for finding the zeros of polynomial. The convergence analysis of each procedure is also discussed. The programming codes are developed and implemented using Matlab R2012b incorporated with Intlab V5.5 toolbox and compared with the existing procedures. The efficiency of the procedures is justified by the numerical results given. The results generated showed that these new procedures produced less computational time, higher rate of convergence and achieved the desired accuracy.
format Thesis
author Wan Mohd Sham, Atiyah
spellingShingle Wan Mohd Sham, Atiyah
Modified algorithms in interval symmetric single-step procedure for simultaneous inclusion of polynomial zeros
author_facet Wan Mohd Sham, Atiyah
author_sort Wan Mohd Sham, Atiyah
title Modified algorithms in interval symmetric single-step procedure for simultaneous inclusion of polynomial zeros
title_short Modified algorithms in interval symmetric single-step procedure for simultaneous inclusion of polynomial zeros
title_full Modified algorithms in interval symmetric single-step procedure for simultaneous inclusion of polynomial zeros
title_fullStr Modified algorithms in interval symmetric single-step procedure for simultaneous inclusion of polynomial zeros
title_full_unstemmed Modified algorithms in interval symmetric single-step procedure for simultaneous inclusion of polynomial zeros
title_sort modified algorithms in interval symmetric single-step procedure for simultaneous inclusion of polynomial zeros
publishDate 2014
url http://psasir.upm.edu.my/id/eprint/55687/1/FS%202014%2038RR.pdf
http://psasir.upm.edu.my/id/eprint/55687/
_version_ 1643835968653885440
score 13.1944895