Solution of Finite Systems of Equations by Interval Iteration.

Abstract

In actual practice, iteration methods applied to the solution of finite systems of equations yield inconclusive results as to the existence or nonexistence of solutions and the accuracy of any approximate solutions obtained. On the other hand, construction of interval extensions of ordinary iteration operators permits one to carry out interval iteration computationally, with results which can give rigorous guarantees of existence or nonexistence of solutions, and error ounds for approximate solutions. Examples are given of the solution of a nonlinear system of equations and the calculation of eigenvalues and eigenvectors of a matrix by interval iteration. Several ways to obtain lower and upper bounds for eigenvalues are given. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1981
Accession Number
ADA110480

Entities

People

  • Louis B. Rall

Organizations

  • University of Wisconsin–Madison

Tags

Communities of Interest

  • Advanced Electronics
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Accuracy
  • Algebra
  • Applied Mathematics
  • Arithmetic
  • Computations
  • Computer Science
  • Differential Equations
  • Eigenvalues
  • Eigenvectors
  • Equations
  • Errors
  • Mathematics
  • Nonlinear Systems
  • Numerical Analysis
  • Real Numbers
  • Theorems
  • United States

Fields of Study

  • Mathematics

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Regression Analysis.