Partial Fraction Decomposition in C(z) and Simultaneous Newton Iteration for Factorization in C[z]

Saved in:
Bibliographic Details
Published inJournal of Complexity Vol. 14; no. 3; pp. 378 - 444
Main Author Kirrinnis, Peter
Format Journal Article
LanguageEnglish
Published 01.09.1998
Online AccessGet full text
ISSN0885-064X
DOI10.1006/jcom.1998.0481

Cover

Author Kirrinnis, Peter
Author_xml – sequence: 1
  givenname: Peter
  surname: Kirrinnis
  fullname: Kirrinnis, Peter
BookMark eNp1kE1LxDAQhnNYwd3Vq-cc9dA66UeaHGV1dWFRQQVBpKRpAlnaZkmyiP31tlU8CJ6GYeZ5eXkWaNbZTiF0RiAmAPRyJ20bE85ZDBkjMzQHxvIIaPZ6jBbe7wAIySmZo-pRuGBEg9dOyGBsh6_VwO6tN9NmOrw67y-w6Gr8ZNpDE0Sn7MHje_URhvsmKCemT20dXg8Z1ple_LJv_fsJOtKi8er0Zy7Ry_rmeXUXbR9uN6urbSSTtAgRExRkkWsuVFoxDZwV9VARZMIrxZjWPJME0poXLCcFT5NcE0oTrmta5USJdImy71zprPdO6VKaMDUJTpimJFCObsrRTTm6KUc3Axb_wfbOtMJ9_gd8AdUdbE8
CitedBy_id crossref_primary_10_1006_jcom_2001_0585
crossref_primary_10_1006_jsco_2002_0531
crossref_primary_10_1016_j_camwa_2010_12_070
crossref_primary_10_1016_j_laa_2014_09_004
crossref_primary_10_1080_03610918_2018_1501483
crossref_primary_10_1016_j_cam_2014_11_031
crossref_primary_10_1016_j_camwa_2011_08_029
crossref_primary_10_1006_jcom_1999_0531
crossref_primary_10_1016_j_cag_2004_03_009
crossref_primary_10_1006_jcom_1999_0532
crossref_primary_10_1016_j_jsc_2017_03_009
crossref_primary_10_1016_j_jsc_2015_03_004
crossref_primary_10_1016_j_camwa_2011_11_015
crossref_primary_10_1070_SM8833
crossref_primary_10_4213_sm8833
crossref_primary_10_1016_j_jsc_2015_06_009
crossref_primary_10_1016_j_tcs_2017_03_030
crossref_primary_10_1016_j_tcs_2017_03_031
crossref_primary_10_1016_S0377_0427_99_00365_9
crossref_primary_10_1016_j_jco_2014_08_002
crossref_primary_10_1016_S0024_3795_02_00594_3
crossref_primary_10_1109_TSP_2004_837413
crossref_primary_10_1016_j_entcs_2008_03_016
crossref_primary_10_1016_j_tcs_2024_115022
crossref_primary_10_1007_s11786_011_0069_2
Cites_doi 10.1006/jcom.1996.0008
10.1016/0020-0190(94)00069-7
10.1137/1018091
10.1016/0898-1221(96)00080-6
10.1090/S0273-0979-1989-15750-9
10.1137/0212001
10.1007/BF02242355
10.1016/0885-064X(89)90010-1
10.1016/0885-064X(87)90022-7
10.1145/322092.322099
10.1007/BF02163334
10.24033/asens.1486
10.1016/0885-064X(85)90024-X
10.1137/0215011
10.1007/BF02162564
10.1137/0209036
10.1137/0729039
10.1090/S0025-5718-1985-0771036-6
10.1090/S0025-5718-1973-0329236-7
10.1145/321062.321064
10.1090/S0273-0979-1981-14858-8
10.1137/0708040
10.1145/321941.321944
10.1016/S0022-0000(05)80061-3
10.1090/S0025-5718-1974-0354624-3
10.1016/0898-1221(87)90186-6
10.1090/S0025-5718-1967-0228165-4
10.1007/BF01188076
10.1007/BF01582052
10.1007/BF01403894
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1006/jcom.1998.0481
DatabaseName CrossRef
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EndPage 444
ExternalDocumentID 10_1006_jcom_1998_0481
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29K
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AATTM
AAXKI
AAXUO
AAYWO
AAYXX
ABAOU
ABJNI
ABMAC
ABWVN
ABXDB
ACDAQ
ACGFS
ACLOT
ACRLP
ACRPL
ACVFH
ADBBV
ADCNI
ADEZE
ADFGL
ADMUD
ADNMO
ADVLN
AEBSH
AEIPS
AEKER
AENEX
AEUPX
AEXQZ
AFJKZ
AFPUW
AFTJW
AGHFR
AGQPQ
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGII
AIGVJ
AIIUN
AIKHN
AITUG
AKBMS
AKRWK
AKYEP
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
APXCP
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CAG
CITATION
COF
CS3
D-I
DM4
EBS
EFBJH
EFKBS
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG5
M25
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
ROL
RPZ
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSW
SSZ
T5K
TN5
TWZ
UPT
WUQ
XPP
YQT
ZMT
ZU3
~G-
~HD
ID FETCH-LOGICAL-c237t-8a60c75f9ae3b8f0987d5610c29be88ff94c103d9785179325f16629fd6b51ea3
ISSN 0885-064X
IngestDate Wed Oct 01 01:30:28 EDT 2025
Thu Apr 24 23:15:53 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c237t-8a60c75f9ae3b8f0987d5610c29be88ff94c103d9785179325f16629fd6b51ea3
PageCount 67
ParticipantIDs crossref_citationtrail_10_1006_jcom_1998_0481
crossref_primary_10_1006_jcom_1998_0481
ProviderPackageCode CITATION
AAYXX
PublicationCentury 1900
PublicationDate 1998-09-01
PublicationDateYYYYMMDD 1998-09-01
PublicationDate_xml – month: 09
  year: 1998
  text: 1998-09-01
  day: 01
PublicationDecade 1990
PublicationTitle Journal of Complexity
PublicationYear 1998
References Neff (10.1006/jcom.1998.0481_CM980481RF26) 1994; 48
Grau (10.1006/jcom.1998.0481_CM980481RF13) 1971; 8
Schönhage (10.1006/jcom.1998.0481_CM980481RF43) 1990
Brent (10.1006/jcom.1998.0481_CM980481RF6) 1978; 25
Smale (10.1006/jcom.1998.0481_CM980481RF52) 1981; 4
Samelson (10.1006/jcom.1998.0481_CM980481RF36) 1958; 95
Pan (10.1006/jcom.1998.0481_CM980481RF28) 1987; 14
Aberth (10.1006/jcom.1998.0481_CM980481RF1) 1973; 27
Jenkins (10.1006/jcom.1998.0481_CM980481RF16) 1970; 14
Pan (10.1006/jcom.1998.0481_CM980481RF30) 1996; 31
Weyl (10.1006/jcom.1998.0481_CM980481RF57) 1924; 20
Renegar (10.1006/jcom.1998.0481_CM980481RF35) 1987; 3
Schönhage (10.1006/jcom.1998.0481_CM980481RF42) 1986
Carstensen (10.1006/jcom.1998.0481_CM980481RF7) 1992; 29
Schönhage (10.1006/jcom.1998.0481_CM980481RF41) 1985; 1
10.1006/jcom.1998.0481_CM980481RF45
Strassen (10.1006/jcom.1998.0481_CM980481RF54) 1983; 12
10.1006/jcom.1998.0481_CM980481RF44
Knuth (10.1006/jcom.1998.0481_CM980481RF21) 1981
Pan (10.1006/jcom.1998.0481_CM980481RF29) 1994
Lehmer (10.1006/jcom.1998.0481_CM980481RF23) 1961; 8
van der Waerden (10.1006/jcom.1998.0481_CM980481RF55) 1971
Henrici (10.1006/jcom.1998.0481_CM980481RF15) 1974
Neff (10.1006/jcom.1998.0481_CM980481RF27) 1996; 12
Schönhage (10.1006/jcom.1998.0481_CM980481RF40) 1982
Shub (10.1006/jcom.1998.0481_CM980481RF49) 1985; 18
Delves (10.1006/jcom.1998.0481_CM980481RF8) 1967; 21
Kerner (10.1006/jcom.1998.0481_CM980481RF18) 1966; 8
Pasquini (10.1006/jcom.1998.0481_CM980481RF31) 1985; 44
Kirrinnis (10.1006/jcom.1998.0481_CM980481RF19) 1994; 51
Weierstrass (10.1006/jcom.1998.0481_CM980481RF56) 1891
Kaltofen (10.1006/jcom.1998.0481_CM980481RF17) 1992
Blum (10.1006/jcom.1998.0481_CM980481RF3) 1989; 21
Friedman (10.1006/jcom.1998.0481_CM980481RF9) 1989; 5
Smale (10.1006/jcom.1998.0481_CM980481RF53) 1986
Green (10.1006/jcom.1998.0481_CM980481RF14) 1976; 18
Ostrowski (10.1006/jcom.1998.0481_CM980481RF33) 1966
Renegar (10.1006/jcom.1998.0481_CM980481RF34) 1985; 32
Frommer (10.1006/jcom.1998.0481_CM980481RF10) 1988; 54
Ko (10.1006/jcom.1998.0481_CM980481RF22) 1991
Brent (10.1006/jcom.1998.0481_CM980481RF5) 1976; 23
Gourdon (10.1006/jcom.1998.0481_CM980481RF11) 1993
Schönhage (10.1006/jcom.1998.0481_CM980481RF46) 1971; 7
Knuth (10.1006/jcom.1998.0481_CM980481RF20) 1973
Mignotte (10.1006/jcom.1998.0481_CM980481RF24) 1974; 28
Preparata (10.1006/jcom.1998.0481_CM980481RF32) 1985
Shub (10.1006/jcom.1998.0481_CM980481RF51) 1993; 6
Schröder (10.1006/jcom.1998.0481_CM980481RF48) 1969
Borodin (10.1006/jcom.1998.0481_CM980481RF4) 1975
Mignotte (10.1006/jcom.1998.0481_CM980481RF25) 1992
Schönhage (10.1006/jcom.1998.0481_CM980481RF38) 1980; 9
Schätzle (10.1006/jcom.1998.0481_CM980481RF37) 1990
Schönhage (10.1006/jcom.1998.0481_CM980481RF47) 1994
Gourdon (10.1006/jcom.1998.0481_CM980481RF12) 1996
Aigner (10.1006/jcom.1998.0481_CM980481RF2) 1988
Schönhage (10.1006/jcom.1998.0481_CM980481RF39) 1982; 144
Shub (10.1006/jcom.1998.0481_CM980481RF50) 1986; 15
References_xml – volume: 12
  start-page: 81
  year: 1996
  ident: 10.1006/jcom.1998.0481_CM980481RF27
  article-title: An efficient algorithm for the complex roots problem
  publication-title: J. Complexity
  doi: 10.1006/jcom.1996.0008
– volume: 51
  start-page: 107
  year: 1994
  ident: 10.1006/jcom.1998.0481_CM980481RF19
  article-title: An optimal bound for path weights in Huffman trees
  publication-title: Inform. Proc. Lett.
  doi: 10.1016/0020-0190(94)00069-7
– year: 1982
  ident: 10.1006/jcom.1998.0481_CM980481RF40
  publication-title: Technical Report
– volume: 18
  start-page: 501
  year: 1976
  ident: 10.1006/jcom.1998.0481_CM980481RF14
  article-title: Simultaneous iteration towards all roots of a complex polynomial
  publication-title: SIAM Rev.
  doi: 10.1137/1018091
– volume: 31
  start-page: 97
  year: 1996
  ident: 10.1006/jcom.1998.0481_CM980481RF30
  article-title: Optimal and nearly optimal algorithms for approximating complex polynomial zeros
  publication-title: Comput. Math. Appl.
  doi: 10.1016/0898-1221(96)00080-6
– volume: 21
  start-page: 1
  year: 1989
  ident: 10.1006/jcom.1998.0481_CM980481RF3
  article-title: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines
  publication-title: Bull. Amer. Math. Soc. (N.S.)
  doi: 10.1090/S0273-0979-1989-15750-9
– volume: 12
  start-page: 1
  year: 1983
  ident: 10.1006/jcom.1998.0481_CM980481RF54
  article-title: The computational complexity of continued fractions
  publication-title: SIAM J. Comput.
  doi: 10.1137/0212001
– volume: 7
  start-page: 281
  year: 1971
  ident: 10.1006/jcom.1998.0481_CM980481RF46
  article-title: Schnelle Multiplikation großer Zahlen
  publication-title: Computing
  doi: 10.1007/BF02242355
– volume: 5
  start-page: 12
  year: 1989
  ident: 10.1006/jcom.1998.0481_CM980481RF9
  article-title: On the convergence of Newton's method
  publication-title: J. Complexity
  doi: 10.1016/0885-064X(89)90010-1
– volume: 3
  start-page: 90
  year: 1987
  ident: 10.1006/jcom.1998.0481_CM980481RF35
  article-title: On the worst-case complexity of approximating zeros of polynomials
  publication-title: J. Complexity
  doi: 10.1016/0885-064X(87)90022-7
– volume: 25
  start-page: 581
  year: 1978
  ident: 10.1006/jcom.1998.0481_CM980481RF6
  article-title: Fast algorithms for manipulating formal power series
  publication-title: J. Assoc. Comput. Mach.
  doi: 10.1145/322092.322099
– ident: 10.1006/jcom.1998.0481_CM980481RF45
– volume: 14
  start-page: 252
  year: 1970
  ident: 10.1006/jcom.1998.0481_CM980481RF16
  article-title: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
  publication-title: Numer. Math.
  doi: 10.1007/BF02163334
– year: 1990
  ident: 10.1006/jcom.1998.0481_CM980481RF37
– year: 1986
  ident: 10.1006/jcom.1998.0481_CM980481RF42
  article-title: Equation solving in terms of computational complexity
– year: 1975
  ident: 10.1006/jcom.1998.0481_CM980481RF4
– year: 1981
  ident: 10.1006/jcom.1998.0481_CM980481RF21
– volume: 18
  start-page: 107
  year: 1985
  ident: 10.1006/jcom.1998.0481_CM980481RF49
  article-title: Computational complexity: On the geometry of polynomials and a theory of cost, Part I
  publication-title: Ann. Sci. École Norm. Sup. (4)
  doi: 10.24033/asens.1486
– volume: 1
  start-page: 118
  year: 1985
  ident: 10.1006/jcom.1998.0481_CM980481RF41
  article-title: Quasi-GCD computations
  publication-title: J. Complexity
  doi: 10.1016/0885-064X(85)90024-X
– volume: 15
  start-page: 145
  year: 1986
  ident: 10.1006/jcom.1998.0481_CM980481RF50
  article-title: Computational complexity: On the geometry of polynomials and a theory of cost, II
  publication-title: SIAM J. Comput.
  doi: 10.1137/0215011
– year: 1991
  ident: 10.1006/jcom.1998.0481_CM980481RF22
– year: 1985
  ident: 10.1006/jcom.1998.0481_CM980481RF32
– volume: 8
  start-page: 290
  year: 1966
  ident: 10.1006/jcom.1998.0481_CM980481RF18
  article-title: Ein Gesamtschrittverfahren zur Berechnung von Nullstellen von Polynomen
  publication-title: Numer. Math.
  doi: 10.1007/BF02162564
– volume: 9
  start-page: 490
  year: 1980
  ident: 10.1006/jcom.1998.0481_CM980481RF38
  article-title: Storage modification machines
  publication-title: SIAM J. Comput.
  doi: 10.1137/0209036
– year: 1891
  ident: 10.1006/jcom.1998.0481_CM980481RF56
  article-title: Neuer Beweis des Satzes, dass jede ganze rationale Function einer Veränderlichen dargestellt werden kann als ein Product aus linearen Functionen derselben Veränderlichen
– volume: 29
  start-page: 601
  year: 1992
  ident: 10.1006/jcom.1998.0481_CM980481RF7
  article-title: On Grau's method for simultaneous factorization of polynomials
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/0729039
– year: 1969
  ident: 10.1006/jcom.1998.0481_CM980481RF48
  article-title: Factorization of polynomials by generalized Newton procedures
– year: 1973
  ident: 10.1006/jcom.1998.0481_CM980481RF20
– year: 1971
  ident: 10.1006/jcom.1998.0481_CM980481RF55
– volume: 44
  start-page: 135
  year: 1985
  ident: 10.1006/jcom.1998.0481_CM980481RF31
  article-title: A globally convergent method for simultaneously finding polynomial roots
  publication-title: Math. Comp.
  doi: 10.1090/S0025-5718-1985-0771036-6
– ident: 10.1006/jcom.1998.0481_CM980481RF44
– year: 1990
  ident: 10.1006/jcom.1998.0481_CM980481RF43
  article-title: Numerik analytischer Funktionen und Komplexität
– volume: 27
  start-page: 339
  year: 1973
  ident: 10.1006/jcom.1998.0481_CM980481RF1
  article-title: Iteration methods for finding all zeros of a polynomial simultaneously
  publication-title: Math. Comp.
  doi: 10.1090/S0025-5718-1973-0329236-7
– volume: 8
  start-page: 151
  year: 1961
  ident: 10.1006/jcom.1998.0481_CM980481RF23
  article-title: A machine method for solving polynomial equations
  publication-title: J. Assoc. Comput. Mach.
  doi: 10.1145/321062.321064
– volume: 4
  start-page: 1
  year: 1981
  ident: 10.1006/jcom.1998.0481_CM980481RF52
  article-title: The fundamental theorem of algebra and complexity theory
  publication-title: Bull. Amer. Math. Soc. (N.S.)
  doi: 10.1090/S0273-0979-1981-14858-8
– volume: 8
  start-page: 425
  year: 1971
  ident: 10.1006/jcom.1998.0481_CM980481RF13
  article-title: The simultaneous improvement of a complete set of approximate factors of a polynomial
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/0708040
– year: 1992
  ident: 10.1006/jcom.1998.0481_CM980481RF25
– year: 1988
  ident: 10.1006/jcom.1998.0481_CM980481RF2
– volume: 23
  start-page: 242
  year: 1976
  ident: 10.1006/jcom.1998.0481_CM980481RF5
  article-title: Fast multiple-precision evaluation of elementary functions
  publication-title: J. Assoc. Comput. Mach.
  doi: 10.1145/321941.321944
– year: 1992
  ident: 10.1006/jcom.1998.0481_CM980481RF17
  publication-title: Technical Report
– volume: 95
  year: 1958
  ident: 10.1006/jcom.1998.0481_CM980481RF36
  article-title: Faktorisierung von Polynomen durch funktionale Iteration
  publication-title: Bayer. Akad. Wiss. Math.-Natur. Kl. Abh.
– year: 1974
  ident: 10.1006/jcom.1998.0481_CM980481RF15
– volume: 48
  start-page: 429
  year: 1994
  ident: 10.1006/jcom.1998.0481_CM980481RF26
  article-title: Specified precision polynomial root isolation is in NC
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1016/S0022-0000(05)80061-3
– year: 1966
  ident: 10.1006/jcom.1998.0481_CM980481RF33
– volume: 28
  start-page: 1153
  year: 1974
  ident: 10.1006/jcom.1998.0481_CM980481RF24
  article-title: An inequality about factors of polynomials
  publication-title: Math. Comp.
  doi: 10.1090/S0025-5718-1974-0354624-3
– volume: 14
  start-page: 591
  year: 1987
  ident: 10.1006/jcom.1998.0481_CM980481RF28
  article-title: Sequential and parallel complexity of approximate evaluation of polynomial zeros
  publication-title: Comput. Math. Appl.
  doi: 10.1016/0898-1221(87)90186-6
– year: 1993
  ident: 10.1006/jcom.1998.0481_CM980481RF11
  publication-title: Rapport de Recherche
– year: 1996
  ident: 10.1006/jcom.1998.0481_CM980481RF12
– volume: 21
  start-page: 543
  year: 1967
  ident: 10.1006/jcom.1998.0481_CM980481RF8
  article-title: A numerical method for locating the zeros of an analytic function
  publication-title: Math. Comp.
  doi: 10.1090/S0025-5718-1967-0228165-4
– year: 1994
  ident: 10.1006/jcom.1998.0481_CM980481RF29
  article-title: New techniques for approximating complex polynomial zeros
– volume: 20
  start-page: 142
  year: 1924
  ident: 10.1006/jcom.1998.0481_CM980481RF57
  article-title: Randbemerkungen zu Hauptproblemen der Mathematik. II. Fundamentalsatz der Algebra und Grundlagen der Mathematik
  publication-title: Math. Z.
  doi: 10.1007/BF01188076
– year: 1994
  ident: 10.1006/jcom.1998.0481_CM980481RF47
– volume: 32
  start-page: 319
  year: 1985
  ident: 10.1006/jcom.1998.0481_CM980481RF34
  article-title: On the cost of approximating all roots of a complex polynomial
  publication-title: Math. Programming
  doi: 10.1007/BF01582052
– volume: 54
  start-page: 105
  year: 1988
  ident: 10.1006/jcom.1998.0481_CM980481RF10
  article-title: A unified approach to methods for the simultaneous computation of all zeros of generalized polynomials
  publication-title: Numer. Math.
  doi: 10.1007/BF01403894
– volume: 144
  year: 1982
  ident: 10.1006/jcom.1998.0481_CM980481RF39
  article-title: Asymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coefficients
– volume: 6
  start-page: 459
  year: 1993
  ident: 10.1006/jcom.1998.0481_CM980481RF51
  article-title: Complexity of Bezout's theorem. I. Geometric aspects
  publication-title: J. Amer. Math. Soc.
– year: 1986
  ident: 10.1006/jcom.1998.0481_CM980481RF53
  article-title: Algorithms for solving equations
SSID ssj0011561
Score 1.6903288
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 378
Title Partial Fraction Decomposition in C(z) and Simultaneous Newton Iteration for Factorization in C[z]
Volume 14
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier Free Content
  issn: 0885-064X
  databaseCode: IXB
  dateStart: 19851001
  customDbUrl:
  isFulltext: true
  dateEnd: 20211103
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0011561
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier Freedom Collection
  issn: 0885-064X
  databaseCode: ACRLP
  dateStart: 19950301
  customDbUrl:
  isFulltext: true
  dateEnd: 20211103
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0011561
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect (Elsevier)
  issn: 0885-064X
  databaseCode: .~1
  dateStart: 19950101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0011561
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect Freedom Collection Journals
  issn: 0885-064X
  databaseCode: AIKHN
  dateStart: 19950301
  customDbUrl:
  isFulltext: true
  dateEnd: 20211031
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0011561
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  issn: 0885-064X
  databaseCode: AKRWK
  dateStart: 19851001
  customDbUrl:
  isFulltext: true
  mediaType: online
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0011561
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1La9wwEBbp5tIeSpu0NH0EHQJtDkptS37omG66JGkTQklgoRSzkiVYCE7Yuhf_-s5YktebByS5GCM0fuizP43smW8I2VGoqZVUggltJBPWxkxWMma5zaTSRmmnpXdymh1eiONpOg0l4X12SaP2dHtnXslTUIU2wBWzZB-BbH9QaIB9wBe2gDBsH4TxGbbBGE8WvuL3gcEQcR-H1SX0gQPZ4sq_i9CcY_jgrDYY9grshooaR52qcog3nHTVd3xqprNPv7WhCPltHxbZBBU1m_7D_I_5YjGva6dcsAz-rZaJdjJ8Vwj0kzJwWKYrXCkGzwQfEB93hXj8HCqcpuMteoZXHOkZ43TwlHsoVrOciMLP9xvzUx816BSWsxLtS7Qv0f4ZWU-A0aMRWd8f__p51v9DgpVp7NYQ7j6CZGeUfV29goFLMvAtzl-Rl35A6b5D-DVZM_UGeXHSK-r-3STKY00D1nQFazqv6fhLu0sBZzrEmTqcaY8zBZzpCs6d7e_2zxtyMfl-Pj5kvj4G0wnPG1bMskjnqZUzw1VhI1nkFbrDOpHKFIW1Uug44pXMCxRi40lq4yxLpK0ylcZmxt-SUX1Vm3eEWphm8tigfGMiLBcKTJJc2woIX_GcbxEWhqjUXjwea5hclneDskU-9_2vnWzKPT3fP7jnB_J8-Zx-JKNm8c98Ao-wUdse-v8OB2Jk
linkProvider Elsevier
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=Partial+Fraction+Decomposition+in+C%28z%29+and+Simultaneous+Newton+Iteration+for+Factorization+in+C%5Bz%5D&rft.jtitle=Journal+of+Complexity&rft.au=Kirrinnis%2C+Peter&rft.date=1998-09-01&rft.issn=0885-064X&rft.volume=14&rft.issue=3&rft.spage=378&rft.epage=444&rft_id=info:doi/10.1006%2Fjcom.1998.0481&rft.externalDBID=n%2Fa&rft.externalDocID=10_1006_jcom_1998_0481
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0885-064X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0885-064X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0885-064X&client=summon