Existence Verification for Singular Zeros of Complex Nonlinear Systems
Authors:
- R. Baker KearfottRKR. Baker Kearfott
- Jianwei DianJDJianwei Dian
- A. NeumaierANA. Neumaier
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 38 (2) , 360-379
Abstract
Computational fixed point theorems can be used to automatically verify existence and uniqueness of a solution to a nonlinear system of n equations in n variables ranging within a given region of n-space. Such computations succeed, however, only when the Jacobi matrix is nonsingular everywhere in this region. However, in problems such as bifurcation problems or surface intersection problems, the Jacobi matrix can be singular, or nearly so, at the solution. For n real variables, when the Jacobi matrix is singular, tiny perturbations of the problem can result in problems either with no solution in the region, or with more than one; thus no general computational technique can prove existence and uniqueness. However, for systems of n complex variables, the multiplicity of such a solution can be verified. That is the subject of this paper. Such verification is possible by computing the topological degree, but such computations heretofore have required a global search on the (n-1)-dimensional boundary of an n-dimensional region. Here it is observed that preconditioning leads to a system of equations whose topological degree can be computed with a much lower-dimensional search. Formulas are given for this computation, and the special case of rank-defect one is studied, both theoretically and empirically. Verification is possible for certain subcases of the real case. That will be the subject of a companion paper.Keywords
This publication has 12 references indexed in Scilit:
- The Poincare-Miranda TheoremThe American Mathematical Monthly, 1997
- Rigorous Global Search: Continuous Problems1996
- A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimizationACM Transactions on Mathematical Software, 1995
- Computation of topological degree using interval arithmetic, and applicationsMathematics of Computation, 1994
- Optimal solution of nonlinear equationsJournal of Complexity, 1985
- An efficient degree-computation method for a generalized method of bisectionNumerische Mathematik, 1979
- An algorithm for numerical calculation of topological degreeApplicable Analysis, 1979
- Methods and Applications of Interval Analysis1979
- Computing the topological degree of a mapping inR nNumerische Mathematik, 1975
- Circular arithmetic and the determination of polynomial zerosNumerische Mathematik, 1971