Convergence and Complexity of Newton Iteration for Operator Equations.

Abstract

An optimal convergence condition for Newton iteration in a Banach space is established. There exist problems for which the iteration converges but the complexity is unbounded. It is shown which stronger condition must be imposed to also assure good complexity.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1977
Accession Number
ADA039300

Entities

People

  • H. Wozniakowski
  • Joseph F. Traub

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Banach Space
  • Computer Science
  • Computers
  • Convergence
  • Equations
  • Functional Analysis
  • Iterations
  • Linear Systems
  • Mathematical Analysis
  • Mathematics
  • Military Research
  • New York
  • Pennsylvania
  • Sequences
  • Universities

Fields of Study

  • Mathematics

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Graph Algorithms and Convex Optimization.

Technology Areas

  • Space