On the efficiencies of the IMSS1 method for bounding polynomial zeros simultaneously

This paper presents an improvement of the existing interval symmetric single-step method ISS1 which will be called the interval midpoint symmetric single-step method IMSS1. The term 'midpoint' is referred to the updated midpoints used in every step in the method. The idea of midpoint will...

Full description

Bibliographic Details
Main Authors: Mohammad Rusli, Syaida Fadhilah, Monsi, Mansor, Hassan, Nasruddin, Md. Ali, Fadzilah
Format: Conference or Workshop Item
Language:English
Published: IEEE 2015
Online Access:http://psasir.upm.edu.my/id/eprint/51856/
http://psasir.upm.edu.my/id/eprint/51856/1/On%20the%20efficiencies%20of%20the%20IMSS1%20method%20for%20bounding%20polynomial%20zeros%20simultaneously.pdf
_version_ 1848851946925981696
author Mohammad Rusli, Syaida Fadhilah
Monsi, Mansor
Hassan, Nasruddin
Md. Ali, Fadzilah
author_facet Mohammad Rusli, Syaida Fadhilah
Monsi, Mansor
Hassan, Nasruddin
Md. Ali, Fadzilah
author_sort Mohammad Rusli, Syaida Fadhilah
building UPM Institutional Repository
collection Online Access
description This paper presents an improvement of the existing interval symmetric single-step method ISS1 which will be called the interval midpoint symmetric single-step method IMSS1. The term 'midpoint' is referred to the updated midpoints used in every step in the method. The idea of midpoint will potentially reduce the time and improve the effectiveness of the method. This method is tested numerically in terms of CPU times and number of iterations of which comparison for both methods will be presented. This procedure is verified on five test polynomials and the results were obtained using MATLAB in association with Intlab toolbox. Based on the numerical results, the IMSS1 method shows a better performance than does the ISS1 method.
first_indexed 2025-11-15T10:30:16Z
format Conference or Workshop Item
id upm-51856
institution Universiti Putra Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T10:30:16Z
publishDate 2015
publisher IEEE
recordtype eprints
repository_type Digital Repository
spelling upm-518562017-05-02T08:05:15Z http://psasir.upm.edu.my/id/eprint/51856/ On the efficiencies of the IMSS1 method for bounding polynomial zeros simultaneously Mohammad Rusli, Syaida Fadhilah Monsi, Mansor Hassan, Nasruddin Md. Ali, Fadzilah This paper presents an improvement of the existing interval symmetric single-step method ISS1 which will be called the interval midpoint symmetric single-step method IMSS1. The term 'midpoint' is referred to the updated midpoints used in every step in the method. The idea of midpoint will potentially reduce the time and improve the effectiveness of the method. This method is tested numerically in terms of CPU times and number of iterations of which comparison for both methods will be presented. This procedure is verified on five test polynomials and the results were obtained using MATLAB in association with Intlab toolbox. Based on the numerical results, the IMSS1 method shows a better performance than does the ISS1 method. IEEE 2015 Conference or Workshop Item PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/51856/1/On%20the%20efficiencies%20of%20the%20IMSS1%20method%20for%20bounding%20polynomial%20zeros%20simultaneously.pdf Mohammad Rusli, Syaida Fadhilah and Monsi, Mansor and Hassan, Nasruddin and Md. Ali, Fadzilah (2015) On the efficiencies of the IMSS1 method for bounding polynomial zeros simultaneously. In: 7th International Conference on Research and Education in Mathematics (ICREM7), 25-27 Aug. 2015, Renaissance Kuala Lumpur Hotel, Malaysia. (pp. 1-4). http://ieeexplore.ieee.org/document/7357015/ 10.1109/ICREM.2015.7357015
spellingShingle Mohammad Rusli, Syaida Fadhilah
Monsi, Mansor
Hassan, Nasruddin
Md. Ali, Fadzilah
On the efficiencies of the IMSS1 method for bounding polynomial zeros simultaneously
title On the efficiencies of the IMSS1 method for bounding polynomial zeros simultaneously
title_full On the efficiencies of the IMSS1 method for bounding polynomial zeros simultaneously
title_fullStr On the efficiencies of the IMSS1 method for bounding polynomial zeros simultaneously
title_full_unstemmed On the efficiencies of the IMSS1 method for bounding polynomial zeros simultaneously
title_short On the efficiencies of the IMSS1 method for bounding polynomial zeros simultaneously
title_sort on the efficiencies of the imss1 method for bounding polynomial zeros simultaneously
url http://psasir.upm.edu.my/id/eprint/51856/
http://psasir.upm.edu.my/id/eprint/51856/
http://psasir.upm.edu.my/id/eprint/51856/
http://psasir.upm.edu.my/id/eprint/51856/1/On%20the%20efficiencies%20of%20the%20IMSS1%20method%20for%20bounding%20polynomial%20zeros%20simultaneously.pdf