The repeated procedure IRTSS1 for simultaneous inclusion of polynomial zeros

Syaida F M Rusli, Mansor Monsi, Nasruddin Hassan, FadzilahMd Ali

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The rate of convergence of theinterval symmetric single-step procedure IRSS1is increased by introducing a Newton’s method (NM) at the beginning of the procedure. The numerical convergence of this new procedure called IRTSS1 is shown. Based on the numerical results, this new procedure performed better than does IRSS1 in terms of improved CPU times while maintaining the number of iterations.

Original languageEnglish
Pages (from-to)3489-3493
Number of pages5
JournalGlobal Journal of Pure and Applied Mathematics
Volume11
Issue number5
Publication statusPublished - 2015

Fingerprint

Zeros of Polynomials
Newton-Raphson method
Program processors
Inclusion
Polynomials
CPU Time
Newton Methods
Rate of Convergence
Iteration
Numerical Results

Keywords

  • Interval procedure
  • R-order of convergence
  • Simple zeros

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics

Cite this

The repeated procedure IRTSS1 for simultaneous inclusion of polynomial zeros. / Rusli, Syaida F M; Monsi, Mansor; Hassan, Nasruddin; Ali, FadzilahMd.

In: Global Journal of Pure and Applied Mathematics, Vol. 11, No. 5, 2015, p. 3489-3493.

Research output: Contribution to journalArticle

Rusli, Syaida F M ; Monsi, Mansor ; Hassan, Nasruddin ; Ali, FadzilahMd. / The repeated procedure IRTSS1 for simultaneous inclusion of polynomial zeros. In: Global Journal of Pure and Applied Mathematics. 2015 ; Vol. 11, No. 5. pp. 3489-3493.
@article{6d769837c93e4209978d4a97525720c0,
title = "The repeated procedure IRTSS1 for simultaneous inclusion of polynomial zeros",
abstract = "The rate of convergence of theinterval symmetric single-step procedure IRSS1is increased by introducing a Newton’s method (NM) at the beginning of the procedure. The numerical convergence of this new procedure called IRTSS1 is shown. Based on the numerical results, this new procedure performed better than does IRSS1 in terms of improved CPU times while maintaining the number of iterations.",
keywords = "Interval procedure, R-order of convergence, Simple zeros",
author = "Rusli, {Syaida F M} and Mansor Monsi and Nasruddin Hassan and FadzilahMd Ali",
year = "2015",
language = "English",
volume = "11",
pages = "3489--3493",
journal = "Global Journal of Pure and Applied Mathematics",
issn = "0973-1768",
publisher = "Research India Publications",
number = "5",

}

TY - JOUR

T1 - The repeated procedure IRTSS1 for simultaneous inclusion of polynomial zeros

AU - Rusli, Syaida F M

AU - Monsi, Mansor

AU - Hassan, Nasruddin

AU - Ali, FadzilahMd

PY - 2015

Y1 - 2015

N2 - The rate of convergence of theinterval symmetric single-step procedure IRSS1is increased by introducing a Newton’s method (NM) at the beginning of the procedure. The numerical convergence of this new procedure called IRTSS1 is shown. Based on the numerical results, this new procedure performed better than does IRSS1 in terms of improved CPU times while maintaining the number of iterations.

AB - The rate of convergence of theinterval symmetric single-step procedure IRSS1is increased by introducing a Newton’s method (NM) at the beginning of the procedure. The numerical convergence of this new procedure called IRTSS1 is shown. Based on the numerical results, this new procedure performed better than does IRSS1 in terms of improved CPU times while maintaining the number of iterations.

KW - Interval procedure

KW - R-order of convergence

KW - Simple zeros

UR - http://www.scopus.com/inward/record.url?scp=84946033056&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84946033056&partnerID=8YFLogxK

M3 - Article

VL - 11

SP - 3489

EP - 3493

JO - Global Journal of Pure and Applied Mathematics

JF - Global Journal of Pure and Applied Mathematics

SN - 0973-1768

IS - 5

ER -