JOURNAL ARTICLE
逼近零点与计算复杂性理论
Year: 1984 Journal: Science in China Series A-Mathematics Physics Astronomy & Technological Science (in Chinese) Vol: 14 (1)Pages: 8-15 Publisher: Science China Press
Abstract
本文比较Smale对Newton方法所作的成本估计和作者对Kuhn算法所作的成本估计. 结果表明,无论是算零点还是算所谓逼近零点,后者都比前者好得多,其比率分别为n9/μ7对n2log(n/ε)和n9/μ7对n3log(n/μ),这里n是多项式的阶数,ε>0是计算零点的精度要求,μ是允许相应的论断失败的概率,0<μ<1.
Keywords:
Physics
Metrics
0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.48
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Iterative Methods for Nonlinear Equations
Physical Sciences → Mathematics → Numerical Analysis
Related Documents
JOURNAL ARTICLE
随机多项式空间和计算复杂性理论
Journal: Science in China Series A-Mathematics Physics Astronomy & Technological Science (in Chinese) Year: 1987 Vol: 17 (1)Pages: 34-43
JOURNAL ARTICLE
树的枚举与树算法复杂性计算
Journal: Chinese Science Bulletin (Chinese Version) Year: 1992 Vol: 37 (9)Pages: 853-856
JOURNAL ARTICLE
Kuhn算法的成本和复杂性理论
Journal: Chinese Science Bulletin (Chinese Version) Year: 1983 Vol: 28 (21)Pages: 1342-1342
JOURNAL ARTICLE
多背包问题近似计算的复杂性
Journal: Chinese Science Bulletin (Chinese Version) Year: 1996 Vol: 41 (20)Pages: 1896-1898