COMPUTATIONAL EXPERIENCE WITH THE CHOW-YORKE

Watson, Layne T. (1978) COMPUTATIONAL EXPERIENCE WITH THE CHOW-YORKE. Technical Report CS78010-R, Computer Science, Virginia Tech.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
CS78010-R.pdf (707308)

Abstract

The Chow-Yorke algorithm is a nonsimplicial homotopy-type method for computing Brouwer fixed points that is globally convergent. It is efficient and accurate for fixed point problems. L. T. Watson, T. Y. Li, and C. Y. Wang have adapted the method for zero finding problems, the nonlinear complementarity problem, and nonlinear two-point boundary value problems. Here theoretical justification is given for applying the method to some mathematical programming problems, and computational results are presented.

Item Type:	Departmental Technical Report
Subjects:	Computer Science > Historical Collection(Till Dec 2001)
ID Code:	832
Deposited By:	Administrator, Eprints
Deposited On:	05 May 2006