On the determination of the safe initial approximation for the Durand-Kerner algorithm

In this paper, applying the majorant function method, we present a new proof of the convergence of the Durand-Kerner method, and obtain a greater computable radius estimation of safe initial discs. This result is an improvement of all results now available. Furthermore, combining the Kuhn algorithm...

Full description

Saved in:
Bibliographic Details
Published inJournal of computational and applied mathematics Vol. 38; no. 1; pp. 447 - 456
Main Authors Deren, Wang, Fengguang, Zhao
Format Journal Article
LanguageEnglish
Published Elsevier B.V 23.12.1991
Subjects
Online AccessGet full text
ISSN0377-0427
1879-1778
DOI10.1016/0377-0427(91)90188-P

Cover

Abstract In this paper, applying the majorant function method, we present a new proof of the convergence of the Durand-Kerner method, and obtain a greater computable radius estimation of safe initial discs. This result is an improvement of all results now available. Furthermore, combining the Kuhn algorithm for solving all zeros of polynomials, we obtain a discriminant to get safe initial discs. Finally, we compare the complexity between the Durand-Kerner algorithm and several known results, and the numerical results show the superiority of our result.
AbstractList In this paper, applying the majorant function method, we present a new proof of the convergence of the Durand-Kerner method, and obtain a greater computable radius estimation of safe initial discs. This result is an improvement of all results now available. Furthermore, combining the Kuhn algorithm for solving all zeros of polynomials, we obtain a discriminant to get safe initial discs. Finally, we compare the complexity between the Durand-Kerner algorithm and several known results, and the numerical results show the superiority of our result.
Author Deren, Wang
Fengguang, Zhao
Author_xml – sequence: 1
  givenname: Wang
  surname: Deren
  fullname: Deren, Wang
– sequence: 2
  givenname: Zhao
  surname: Fengguang
  fullname: Fengguang, Zhao
BookMark eNqFkE1LAzEQhoNUsK3-Aw971MPqZL9m14MgrV9YaA_Fa8gmszayTUo2iv5726148KCngeF9hnneERtYZ4mxUw4XHHhxCSliDFmCZxU_r4CXZbw4YENeYhVzxHLAhj-RIzbqulcAKCqeDdnz3EZhRZGmQH5trAzG2cg1_bKTDUXGmmBkG8nNxrsPs94nGuf7yPTNS6vjJ_KWfCTbF-dNWK2P2WEj245OvueYLe9ul5OHeDa_f5zczGKVIoRYlZjoGrAiSZAAzyVXaS2TRAPyIik0opZ1nlNR8FqnDRaQU1YjVnVTUpKOWbY_q7zrOk-N2Pjth_5TcBC7asTOW-y8RcVFX41YbLGrX5gyofcKXpr2P_h6D9PW692QF50yZBVp40kFoZ35-8AXYo2ASA
CitedBy_id crossref_primary_10_1016_j_cam_2003_12_040
crossref_primary_10_1016_j_jco_2015_10_001
crossref_primary_10_1016_j_aml_2015_08_016
crossref_primary_10_3390_sym11060736
crossref_primary_10_1007_s13160_014_0138_4
crossref_primary_10_1080_00207160310001650107
Cites_doi 10.1016/0771-050X(82)90007-9
10.1007/BF02241861
10.1007/BF02162564
ContentType Journal Article
Copyright 1991
Copyright_xml – notice: 1991
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/0377-0427(91)90188-P
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1879-1778
EndPage 456
ExternalDocumentID 10_1016_0377_0427_91_90188_P
037704279190188P
GroupedDBID --K
--M
-~X
.~1
0R~
1B1
1RT
1~.
1~5
29K
4.4
457
4G.
5GY
5VS
6I.
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAFWJ
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
ABAOU
ABEFU
ABFNM
ABJNI
ABMAC
ABTAH
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ADBBV
ADEZE
ADMUD
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
D-I
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
NCXOZ
NHB
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
RNS
ROL
RPZ
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSW
SSZ
T5K
TN5
UPT
WUQ
XPP
YQT
ZMT
ZY4
~02
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c370t-c872db079eae02015a1c3ba22d071626d77dab55e661bd3f7605e4b779bf8e23
IEDL.DBID IXB
ISSN 0377-0427
IngestDate Wed Oct 01 04:36:34 EDT 2025
Thu Apr 24 23:00:07 EDT 2025
Fri Feb 23 02:18:56 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords safe initial approximation
complex polynomial
Durand-Kerner algorithm
Kuhn algorithm
majorant functions
circular iteration
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c370t-c872db079eae02015a1c3ba22d071626d77dab55e661bd3f7605e4b779bf8e23
OpenAccessLink https://www.sciencedirect.com/science/article/pii/037704279190188P
PageCount 10
ParticipantIDs crossref_primary_10_1016_0377_0427_91_90188_P
crossref_citationtrail_10_1016_0377_0427_91_90188_P
elsevier_sciencedirect_doi_10_1016_0377_0427_91_90188_P
ProviderPackageCode CITATION
AAYXX
PublicationCentury 1900
PublicationDate 1991-12-23
PublicationDateYYYYMMDD 1991-12-23
PublicationDate_xml – month: 12
  year: 1991
  text: 1991-12-23
  day: 23
PublicationDecade 1990
PublicationTitle Journal of computational and applied mathematics
PublicationYear 1991
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Kerner (BIB3) 1966; 8
Petković, Stefanovic (BIB5) 1985; 3
Durand (BIB1) 1960
Petković (BIB4) 1982; 8
Wang, Zhao (BIB6) 1989; 43
Wang, Zheng (BIB7) 1984; 2
Karamardian (BIB2) 1977
Kerner (10.1016/0377-0427(91)90188-P_BIB3) 1966; 8
Petković (10.1016/0377-0427(91)90188-P_BIB5) 1985; 3
Wang (10.1016/0377-0427(91)90188-P_BIB6) 1989; 43
Durand (10.1016/0377-0427(91)90188-P_BIB1) 1960
Petković (10.1016/0377-0427(91)90188-P_BIB4) 1982; 8
Wang (10.1016/0377-0427(91)90188-P_BIB7) 1984; 2
Karamardian (10.1016/0377-0427(91)90188-P_BIB2) 1977
References_xml – year: 1977
  ident: BIB2
  article-title: Fixed Points-Algorithm and Applications
– volume: 2
  start-page: 305
  year: 1984
  end-page: 309
  ident: BIB7
  article-title: The quasi-Newton in paralled circular iteration
  publication-title: J. Comput. Math.
– year: 1960
  ident: BIB1
  publication-title: Solutions Numériques des Equations Algébriques, Tome 1: Equation du Type F(χ)=0, Racines d'un Polynome
– volume: 43
  start-page: 187
  year: 1989
  end-page: 197
  ident: BIB6
  article-title: Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
  publication-title: Computing
– volume: 8
  start-page: 290
  year: 1966
  end-page: 294
  ident: BIB3
  article-title: Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
  publication-title: Numer. Math.
– volume: 8
  start-page: 51
  year: 1982
  end-page: 56
  ident: BIB4
  article-title: On an iterative method for simultaneous inclusion of polynomial complex zeros
  publication-title: J. Comput. Appl. Math.
– volume: 3
  start-page: 63
  year: 1985
  end-page: 95
  ident: BIB5
  article-title: On the simultaneous method of the second order for finding polynomial complex zeros in circular arithmetic
  publication-title: Fib.
– volume: 8
  start-page: 51
  issue: 1
  year: 1982
  ident: 10.1016/0377-0427(91)90188-P_BIB4
  article-title: On an iterative method for simultaneous inclusion of polynomial complex zeros
  publication-title: J. Comput. Appl. Math.
  doi: 10.1016/0771-050X(82)90007-9
– volume: 3
  start-page: 63
  year: 1985
  ident: 10.1016/0377-0427(91)90188-P_BIB5
  article-title: On the simultaneous method of the second order for finding polynomial complex zeros in circular arithmetic
  publication-title: Fib.
– volume: 43
  start-page: 187
  year: 1989
  ident: 10.1016/0377-0427(91)90188-P_BIB6
  article-title: Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
  publication-title: Computing
  doi: 10.1007/BF02241861
– year: 1977
  ident: 10.1016/0377-0427(91)90188-P_BIB2
– year: 1960
  ident: 10.1016/0377-0427(91)90188-P_BIB1
  publication-title: Solutions Numériques des Equations Algébriques, Tome 1: Equation du Type F(χ)=0, Racines d'un Polynome
– volume: 8
  start-page: 290
  year: 1966
  ident: 10.1016/0377-0427(91)90188-P_BIB3
  article-title: Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
  publication-title: Numer. Math.
  doi: 10.1007/BF02162564
– volume: 2
  start-page: 305
  year: 1984
  ident: 10.1016/0377-0427(91)90188-P_BIB7
  article-title: The quasi-Newton in paralled circular iteration
  publication-title: J. Comput. Math.
SSID ssj0006914
Score 1.4280989
Snippet In this paper, applying the majorant function method, we present a new proof of the convergence of the Durand-Kerner method, and obtain a greater computable...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 447
SubjectTerms circular iteration
complex polynomial
Durand-Kerner algorithm
Kuhn algorithm
majorant functions
safe initial approximation
Title On the determination of the safe initial approximation for the Durand-Kerner algorithm
URI https://dx.doi.org/10.1016/0377-0427(91)90188-P
Volume 38
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier ScienceDirect Open Access Journals
  customDbUrl:
  eissn: 1879-1778
  dateEnd: 20211103
  omitProxy: true
  ssIdentifier: ssj0006914
  issn: 0377-0427
  databaseCode: IXB
  dateStart: 19750301
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1879-1778
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006914
  issn: 0377-0427
  databaseCode: AKRWK
  dateStart: 19750301
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF6kXvQgPrE-Sg4e9LAkm02y2WN9lGpRi1TtLewrGqhpaVPw57u7eVBBFDxmmFnCx_LNLMx8A8CZlASpAEkYMg_DIMIYMkkJVAL5PFY0oMI2yD5E_efgbhyOV2ZhTFtlxf0lp1u2rixuhaY7yzLXw4SYRRHUpLQ4HmoaxkFstjfcji8bMo5oKe-tnaHxrqfnUOQ2tnOKLuwZcPhzdlrJOL1tsFWVik63_JsdsKbyXbB53-isLvbAy2Pu6E9H1k0tBmZnmlrjgqXKyUxzkD7Faod_ZuWgoqMrVetyvdSpSsKBMuvuHTZ5m86z4v1jH4x6N6OrPqw2JUCBiVdAERNfco9QxZSu_1DIkMCc-b70jEJUJAmRjIeh0tmYS5wS_YhRASeE8jRWPj4ArXyaq0PgmAeFwCz1ZaBrFUxoRFLBRJpSzqWubdsA1wAlolIRN8ssJkndLmZgTQysCUWJhTUZtgFsomalisYf_qTGPvl2GxJN9L9GHv078hhs2DYw5EMfn4BWMV-qU11wFLwD1ruDp9dBx16tL-IV0GY
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF60HtSD-MT6zMGDHpZms0k2e_RJtQ97qNLbsq9ooLalTcGf7-4mKRVEwWOGmSV8LDPfwsw3AFwoRZAOkYIR9zEMY4whV5RALVEgEk1DKl2DbDduvoRPg2iwNAtj2yrL3F_kdJetS0ujRLMxybKGjwmxiyKoLWlJ0lsFa2FkyIkd4hvcLLJxTAt9b-MNrXs1PofixsJ2SdGVOwT2fi5PSyXnYRtslVzRuy5-Zwes6NEu2OwshFZne-D1eeSZT09VXS0WZ2-cOuOMp9rLbHeQOcWJh39mxaSiZ6iqc7mbm1qlYEvbffceH76Np1n-_rEP-g_3_dsmLFclQImJn0OZkEAJn1DNtSGAKOJIYsGDQPlWIipWhCguokibciwUTol5xehQEEJFmugAH4DaaDzSh8CzLwqJeRqo0JAVTGhMUsllmlIhlCG3dYArgJgsZcTtNoshq_rFLKzMwsooYg5W1qsDuIiaFDIaf_iTCnv27Towk-l_jTz6d-Q5WG_2O23Wfuy2jsGG6wlDAQzwCajl07k-NewjF2fuen0B6fTR6Q
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+determination+of+the+safe+initial+approximation+for+the+Durand-Kerner+algorithm&rft.jtitle=Journal+of+computational+and+applied+mathematics&rft.au=Deren%2C+Wang&rft.au=Fengguang%2C+Zhao&rft.date=1991-12-23&rft.issn=0377-0427&rft.volume=38&rft.issue=1-3&rft.spage=447&rft.epage=456&rft_id=info:doi/10.1016%2F0377-0427%2891%2990188-P&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_0377_0427_91_90188_P
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-0427&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-0427&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-0427&client=summon