AN ALGORITHM FOR COMPUTING THE ROOTS OF A COMPLEX POLYNOMIAL

被引：1

|

作者：

AURAND, JF

机构：

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 1987年 / 32卷 / 02期

关键词：

D O I：

10.1109/TAC.1987.1104534

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：164 / 166

页数：3

相关论文

共 50 条

[1] A Parallel Algorithm for Finding Roots of a Complex Polynomial
程锦松
[J]. Journal of Computer Science & Technology, 1990, (01) : 71 - 81
[2] Algorithm 835: MultRoot - A Matlab package for computing polynomial roots and multiplicities
Zeng, ZG
[J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2004, 30 (02): : 218 - 236
[3] A fast algorithm for computing multiplicative relations between the roots of a generic polynomial
Zheng, Tao
[J]. JOURNAL OF SYMBOLIC COMPUTATION, 2021, 104 : 381 - 401
[4] Complex roots of a polynomial
Lau, KW
[J]. AMERICAN MATHEMATICAL MONTHLY, 2000, 107 (02): : 181 - 182
[5] Optimization of complex functions and the algorithm for exact geometric search for complex roots of a polynomial
Trofimov, Sergey P.
[J]. IFAC PAPERSONLINE, 2018, 51 (32): : 883 - 888
[6] Isolating complex polynomial roots: An algebraic algorithm using Sturm sequences
CamargoBrunetto, MAO
Trevisan, V
Claudio, D
[J]. ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1996, 76 : 367 - 368
[7] FINDING POLYNOMIAL ROOTS - A FAST ALGORITHM CONVERGENT ON THE COMPLEX-PLANE
IVANISOV, AV
POLISHCHUK, VK
[J]. COMMUNICATIONS IN APPLIED NUMERICAL METHODS, 1985, 1 (06): : 287 - 291
[8] REVISITING THE STABILITY OF COMPUTING THE ROOTS OF A QUADRATIC POLYNOMIAL
Mastronardi, Nicola
Van Dooren, Paul
[J]. ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS, 2015, 44 : 73 - 82
[9] Revisiting the stability of computing the roots of a quadratic polynomial
Mastronardi, Nicola
Van Dooren, Paul
[J]. Electronic Transactions on Numerical Analysis, 2015, 44 : 73 - 82
[10] Complex roots of a random algebraic polynomial
Farahmand, K
[J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1997, 210 (02) : 724 - 730

← 1 2 3 4 5 →