.png){kind=icon}
返回
Locating and computing arbitrarily distributed zeros
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827598333806.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of locating and computing with certainty all the simple roots of a twice continuously differentiable function f: [a, b] subset of R --> R is studied when some additional information on the distribution of the roots in the interval is available. The framework is the one proposed by [SIAM J. Sci. Comput., 17 (1996), pp. 1232-1248], where only the uniform case was examined. This paper settles some of the problems posed there and generalizes some of its results by considering an arbitrary distribution of the roots in [a, b]. The theoretical results are accompanied by simulations in a number of problems of various size.
Keyword:
zeros isolation
Kronecker-Picard theory
topological degree
locating simple roots
computing simple roots
zeros identifications
bisection method
distribution of the roots
expected complexity of algorithms
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
SR-LDA: Mining Effective Representations for Generating Service Ecosystem Knowledge MapsSR-LDA：挖掘有效表示以生成服务生态系统知识图谱
PREAI
分享收藏
查看更多内容