Document Type

Presentation

Publication Date

4-1982

Publication Title

Illinois State Academy of Science Annual Meeting

Abstract

We introduce an interval Newton method for bounding solutions of systems of nonlinear equations. It entails three sub-algorithms. The first is a Gauss-Seidel type step. The second is a real (non-interval) Newton iteration. The third solves the linearized equations by elimination. We explain why each sub-algorithm is desirable and how they fit together to provide solutions in as little as 1/3 to 1/4 the time required by a commonly used method due to Krawczyk.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.

Share

COinS