Interval iterative methods on simultaneous inclusion of polynomial zeros

The main aim of the thesis is to modified procedures of bounding real zeros of polynomials simultaneously. For this purpose the interval approach is used in order to obtain faster and more accurate results. The research is based on the existing procedures: the interval symmetric single-step ISS1 and...

Full description

Saved in:

Bibliographic Details
Main Author:	Mohammad Rusli, Syaida Fadhilah
Format:	Thesis
Language:	English
Published:	2017
Subjects:	Algebra Polynomials
Online Access:	http://psasir.upm.edu.my/id/eprint/70877/1/FS%202017%2031%20IR.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-upm-ir.70877
record_format	uketd_dc
spelling	my-upm-ir.708772019-08-07T01:21:57Z Interval iterative methods on simultaneous inclusion of polynomial zeros 2017-04 Mohammad Rusli, Syaida Fadhilah The main aim of the thesis is to modified procedures of bounding real zeros of polynomials simultaneously. For this purpose the interval approach is used in order to obtain faster and more accurate results. The research is based on the existing procedures: the interval symmetric single-step ISS1 and the interval repeated single-step IRSS1. To begin with, the basic concepts of interval computations and some brief introductions on Newton’s method are provided. The modifications done in this thesis can be grouped into two types. The first is the repeated procedures and the second type is the Newton’s modified procedures. The modified procedures proposed consist of four repeated procedures and two Newton’s modified procedures. The algorithms of these modified procedures are elaborated to show the significance of each procedure. Theoretically, the analyses of inclusions for all procedures are presented to ensure the inclusions property of the procedures. In order to find the rate of convergence of the procedures, the analyses of R-order of convergence are discussed in detail. To obtain the numerical results, coding for the procedures are developed and implemented using the MATLAB R2007a combined with the Intlab toolbox. Numerical results are presented in terms of CPU times, number of iterations and the widths of final intervals to indicate the accuracies of the procedure. For the conclusion, faster computational time and good accuracies are achieved from the new modified procedures. Furthermore, they attained higher rate of convergences than the existing procedures. Algebra Polynomials 2017-04 Thesis http://psasir.upm.edu.my/id/eprint/70877/ http://psasir.upm.edu.my/id/eprint/70877/1/FS%202017%2031%20IR.pdf text en public doctoral Universiti Putra Malaysia Algebra Polynomials
institution	Universiti Putra Malaysia
collection	PSAS Institutional Repository
language	English
topic	Algebra Polynomials
spellingShingle	Algebra Polynomials Mohammad Rusli, Syaida Fadhilah Interval iterative methods on simultaneous inclusion of polynomial zeros
description	The main aim of the thesis is to modified procedures of bounding real zeros of polynomials simultaneously. For this purpose the interval approach is used in order to obtain faster and more accurate results. The research is based on the existing procedures: the interval symmetric single-step ISS1 and the interval repeated single-step IRSS1. To begin with, the basic concepts of interval computations and some brief introductions on Newton’s method are provided. The modifications done in this thesis can be grouped into two types. The first is the repeated procedures and the second type is the Newton’s modified procedures. The modified procedures proposed consist of four repeated procedures and two Newton’s modified procedures. The algorithms of these modified procedures are elaborated to show the significance of each procedure. Theoretically, the analyses of inclusions for all procedures are presented to ensure the inclusions property of the procedures. In order to find the rate of convergence of the procedures, the analyses of R-order of convergence are discussed in detail. To obtain the numerical results, coding for the procedures are developed and implemented using the MATLAB R2007a combined with the Intlab toolbox. Numerical results are presented in terms of CPU times, number of iterations and the widths of final intervals to indicate the accuracies of the procedure. For the conclusion, faster computational time and good accuracies are achieved from the new modified procedures. Furthermore, they attained higher rate of convergences than the existing procedures.
format	Thesis
qualification_level	Doctorate
author	Mohammad Rusli, Syaida Fadhilah
author_facet	Mohammad Rusli, Syaida Fadhilah
author_sort	Mohammad Rusli, Syaida Fadhilah
title	Interval iterative methods on simultaneous inclusion of polynomial zeros
title_short	Interval iterative methods on simultaneous inclusion of polynomial zeros
title_full	Interval iterative methods on simultaneous inclusion of polynomial zeros
title_fullStr	Interval iterative methods on simultaneous inclusion of polynomial zeros
title_full_unstemmed	Interval iterative methods on simultaneous inclusion of polynomial zeros
title_sort	interval iterative methods on simultaneous inclusion of polynomial zeros
granting_institution	Universiti Putra Malaysia
publishDate	2017
url	http://psasir.upm.edu.my/id/eprint/70877/1/FS%202017%2031%20IR.pdf
_version_	1747812926598676480

Interval iterative methods on simultaneous inclusion of polynomial zeros

Similar Items