On Existence and Uniqueness Verification for Non-Smooth Functions
Given an approximate solution to a nonlinear system of equations at which the Jacobi matrix is nonsingular, and given that the Jacobi matrix is continuous in a region about this approximate solution, a small box can be constructed about the approximate solution in which interval Newton methods can verify existence and uniqueness of an actual solution. Recently, we have shown how to verify existence and uniqueness, up to multiplicity, for solutions at which the Jacobi matrix is singular. We do this by efficient computation of the topological index over a small box containing the approximate solution. Since the topological index is defined and computable when the Jacobi matrix is not even defined at the solution, one may speculate that efficient algorithms can be devised for verification in this case, too. In this note, however, we discuss, through examples, key techniques underlying our simplification of the calculations that cannot necessarily be used when the function is non-smooth. We also present those parts of the theory that are valid in the non-smooth case, and suggest when degree computations involving non-smooth functions may be practical.
As a bonus, the examples lead to additional understanding of previously published work on verification involving the topological degree.
Unable to display preview. Download preview PDF.
- 1.Aberth, O.: Computation of Topological Degree Using Interval Arithmetic and Applications, Math. Comp. 62 (205) (1994), pp. 171–178.Google Scholar
- 2.Alexandroff, P. and Hopf, H.: Topologie, Chelsea, 1935.Google Scholar
- 3.Cronin, J.: Fixed Points and Topological Degree in Nonlinear Analysis, American Mathematical Society, Providence, RI, 1964.Google Scholar
- 4.Dian, J.: Existence Verification of Higher Degree Singular Zeros of Nonlinear Systems, University of Louisiana at Lafayette, 2000.Google Scholar
- 5.Dian, J. and Kearfott, R. B.: Existence Verification for Singular and Non-Smooth Zeros of Real Nonlinear Systems, 2001.Google Scholar
- 6.Hansen, E. R.: Global Optimization Using Interval Analysis, Marcel Dekker, New York, 1992.Google Scholar
- 7.Kearfott, R. B.: An Efficient Degree-Computation Method for a Generalized Method of Bisection, Numer. Math. 32 (1979), pp. 109–127.Google Scholar
- 8.Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht, 1996.Google Scholar
- 9.Kearfott, R. B. and Dian, J.: Existence Verification for Higher Degree Singular Zeros of Complex Nonlinear Systems, preprint, 2000, http://interval.louisiana.edu/preprints/ degree cplx.0302.pdf.Google Scholar
- 10.Kearfott, R. B. and Dian, J.: Verifying Topological Indices for Higher-Order Rank Deficiencies, 2000.Google Scholar
- 11.Kearfott, R. B., Dian, J., and Neumaier, A.: Existence Verification for Singular Zeros of Complex Nonlinear Systems, SIAM J. Numer. Anal. 38 (2) (2000), pp. 360–379.Google Scholar
- 12.Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990.Google Scholar
- 13.Ortega, J. M. and Rheinboldt, W. C.: Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.Google Scholar
- 14.Stenger, F.: An Algorithm for the Topological Degree of a Mapping in Rn, Numer. Math. 25 (1976), pp. 23–38.Google Scholar
- 15.Stynes, M.: An Algorithm for Numerical Calculation of the Topological Degree, Applicable Anal. 9 (1979), pp. 63–77.Google Scholar
- 16.Vrahatis, M. N.: The Topological Degree for the Generalized Method of Bisection, Technical Report 6, Dept. of Math., Univ. of Patras, 1981.Google Scholar
- 17.Walster, G.W., Hansen, E. R., and Pryce, J. D.: Practical, Exception-Free Interval Arithmetic on the Extended Reals, preprint, 2001.Google Scholar