CONVERGENCE AND COMPLEXITY OF NEWTON ITERATION FOR OPERATOR EQUATIONS

被引：74

作者：

TRAUB, JF

WOZNIAKOWSKI, H

机构：

[1] Department of Computer Science, Carnegie-Mellon University, Pittsburgh

来源：

JOURNAL OF THE ACM | 1979年 / 26卷 / 02期

关键词：

complexity; convergence; Newton iteratton; operator equations; optunal algontlun;

D O I：

10.1145/322123.322130

中图分类号：

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

学科分类号：

0812 ;

摘要：

An optmaal convergence condmon for Newton teratmn m a Banach space ts estabhshed It is shown that there exist problems for whtch the teraUon converges but the complextty ts unbounded Thus for actual computation convergence is not enough What stronger condmon must be unposed to also assure “good complextty” is shown. © 1979, ACM. All rights reserved.

引用

页码：250 / 258

页数：9

共 9 条

[1]

DENHEIJER C, 1976, NW3276 MATH CTR REP

[2] OPTIMAL ERROR BOUNDS FOR NEWTON-KANTOROVICH THEOREM [J].

GRAGG, WB ;

TAPIA, RA .

SIAM JOURNAL ON NUMERICAL ANALYSIS, 1974, 11 (01) :10-13

[3]

Kantorovich LV., 1948, USP MAT NAUK, V3, P89

[4]

Rall L.B., 1969, COMPUTATIONAL SOLUTI

[5] CONVERGENCE OF NEWTONS METHOD [J].

RALL, LB .

SIAM JOURNAL ON NUMERICAL ANALYSIS, 1974, 11 (01) :34-36

[6]

RHEINBOLDT WC, 1975, TR393 U MAR TECH REP

[7]

TRAUB J, UNPUBLISHED

[8]

TRAUB JF, 1976, ANAL COMPUTATIONAL C, P15

[9]

TRAUB JF, 1977, CONVERGENCE COMPLEXI

← 1 →