Newton's method and some complexity aspects of the zero-finding problem

被引：0
|
作者：
Dedieu, JP [1 ]
机构：
[1] Univ Toulouse 3, MIP, Dept Math, F-31062 Toulouse 04, France
来源：
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS | 2001年 / 284卷
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Newton's iteration is a classical numerical method to find a zero of a nonlinear system of equations. In this paper we discuss recent advances in this subject: homogeneous and multihomogeneous systems, overdetermined and underdetermined systems are considered. We also discuss some complexity aspects of continuation methods using Newton's method.
引用
收藏
页码：45 / 67
页数：23
相关论文
共 50 条
12345