THE IMPLICIT FUNCTION THEOREM REVISITED

被引：2

作者：

SHUB, M

机构：

来源：

IBM JOURNAL OF RESEARCH AND DEVELOPMENT | 1994年 / 38卷 / 03期

关键词：

D O I：

10.1147/rd.383.0259

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper is a survey of some results on Newton's method as applied to the implicit function theorem, homotopy methods, and Bezout's theorem. An application to macroeconomics is also described.

引用

页码：259 / 264

页数：6

共 12 条

[1] ON A THEORY OF COMPUTATION AND COMPLEXITY OVER THE REAL NUMBERS - NP-COMPLETENESS, RECURSIVE FUNCTIONS AND UNIVERSAL MACHINES [J].

BLUM, L ;

SHUB, M ;

SMALE, S .

BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1989, 21 (01) :1-46

[2] ON THE EFFICIENCY OF NEWTON METHOD IN APPROXIMATING ALL ZEROS OF A SYSTEM OF COMPLEX POLYNOMIALS [J].

RENEGAR, J .

MATHEMATICS OF OPERATIONS RESEARCH, 1987, 12 (01) :121-148

[3]

Shub M., 1993, Journal of Complexity, V9, P4, DOI 10.1006/jcom.1993.1002

[4]

SHUB M, 1993, TOPOLOGY COMPUTATION

[5]

SHUB M, 1993, J AM MATH SOC, V6, P4598

[6]

SHUB M, 1994, IBM18921 TJ WATS RES

[7] THE FUNDAMENTAL THEOREM OF ALGEBRA AND COMPLEXITY THEORY [J].

SMALE, S .

BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1981, 4 (01) :1-36

[8]

SMALE S, 1981, HDB MATH EC, V1, pCH8

[9]

SMALE S, 1987, 1986 P INT C MATH BE

[10]

SMALE S, 1986, MERGING DISCIPLINES

← 1 2 →