Tensor Methods for Nonlinear Equations.

Abstract

A new class of methods for solving systems of nonlinear equations, called tensor methods, is introduced. Tensor methods are general purpose methods intended especially for problems where the Jacobian matrix at the solution is singular or ill-conditioned. They base each iteration on a quadratic model of the nonlinear function, the standard linear model augmented by a simple second order term. The second order term is selected so that the model interpolates function values from several previous iterations, as well as the current function value and Jacobian. The tensor method requires no more function and derivative information per iteration, and hardly more storage or arithmetic per iteration, than a standard method based on Newton's method. In extensive computational tests, a tensor algorithm is significantly more efficient than a similar algorithm based on the standard linear model, both on standard nonsingular test problems and on problems where the Jacobian at the solution is singular. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1983
Accession Number
ADA128750

Entities

People

  • Paul D. Frank
  • Robert B. Schnabel

Organizations

  • University of Colorado Boulder

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Arithmetic
  • Computer Science
  • Computers
  • Differential Equations
  • Equations
  • Iterations
  • Linear Systems
  • Mathematics
  • Numbers
  • Numerical Analysis
  • Quadratic Equations
  • Security
  • Statistics
  • Test Sets
  • Theorems
  • Three Dimensional

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Operations Research