skip to main content
article
Free Access

Solving systems of nonlinear equations using the nonzero value of the topological degree

Published:01 December 1988Publication History
Skip Abstract Section

Abstract

Two algorithms are described here for the numerical solution of a system of nonlinear equations F(X) = Θ, Θ(0,0,…,0)∈ ℝ, and F is a given continuous mapping of a region 𝒟 in ℝn into ℝn. The first algorithm locates at least one root of the sy stem within n-dimensional polyhedron, using the non zero v alue of the topological degree of F at θ relative to the polyhedron; th e second algorithm applies a new generalized bisection method in order to compute an approximate solution to the system. Teh size of the original n-dimensional polyhedron is arbitrary, and the method is globally convergent in a residual sense.

These algorithms, in the various function evaluations, only make use of the algebraic sign of F and do not require computations of the topological degree. Moreover, they can be applied to nondifferentiable continuous functions F and do not involve derivatives of F or approximations of such derivatives.

References

  1. 1 ALEXANDROFF, P., AND HOPF, H. Topologie. Springer-Verlag, Berlin, 1935. Reprinted: Chelsea, Bronx, N.Y., 1965.Google ScholarGoogle Scholar
  2. 2 CRONIN, J. Fixed Points and Topological Degree in Nonlinear Analysis. American Mathematical Society, Providence, R.I., 1964.Google ScholarGoogle Scholar
  3. 3 EIGER, A., SIKORSKI, K., AND STENGER, F. A bisection method for systems of nonlinear equations. ACM Trans. Math. Softw. 10, 4 (Dec. 1984), 367-377. Google ScholarGoogle Scholar
  4. 4 GONNET, G.H. On the structure of zero finders. Bit 17 (1977), 170-183.Google ScholarGoogle Scholar
  5. 5 GRAPSA, T. N., AND VRAHATIS, M.N. The implicit function theorem for solving systems of nonlinear equations in R2. Int. J. Comput. Math. To be published.Google ScholarGoogle Scholar
  6. 6 HARVEY, C., AND STENGER, F. A two-dimensional analogue to the method of bisections for solving nonlinear equations. Q. Appl. Math. 5, 33 (1976), 351-368.Google ScholarGoogle Scholar
  7. 7 KEARFOTT, R.B. Computing the degree of maps and a generalized method of bisection. Ph.D. dissertation, Dept. of Mathematics, Univ. of Utah, Salt Lake City, 1977. Google ScholarGoogle Scholar
  8. 8 KEARFOTT, R.B. An efficient degree-computation method for a generalized method of bisection. Numer. Math. 32 (1979), 109-127.Google ScholarGoogle Scholar
  9. 9 KEARFOTT, R.B. Abstract generalized bisection and a cost bound. Math. Comput. 49, 179 (July 1987), 187-202.Google ScholarGoogle Scholar
  10. 10 KEARFOTT, R.B. Some tests of generalized bisection. ACM Trans. Math. Softw. 13, 3 (Sept. 1987), 197-220. Google ScholarGoogle Scholar
  11. 11 KNUTH, D.E. The Art of Computer Programming. Vol. 2, Seminumerical Algorithms. Addison- Wesley, Reading, Mass., 1969. Google ScholarGoogle Scholar
  12. 12 MOR~, J. J., AND COSNARD, M.Y. BRENTM, A Fortran subroutine for the numerical solution of systems of nonlinear equations. ACM Trans. Math. Softw. 6, 2 (June 1980), 240-251. Google ScholarGoogle Scholar
  13. 13 MORE, J. J., GARBOW, B. S., AND HILLSTROM, K. E. Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 1 (Mar. 1981), 17-41. Google ScholarGoogle Scholar
  14. 14 ORTE(~A, J. M., AND RHEINBOLDT, W.C. iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York, 1970.Google ScholarGoogle Scholar
  15. 15 SIKORSKI, K. A three-dimensional analogue to the method of bisections for solving nonlinear equations. Math. Comput. 33, 146 (1979), 722-738.Google ScholarGoogle Scholar
  16. 16 SIKORSKI, K. Bisection is optimal. Numer. Math. 40 (1982), 111-117.Google ScholarGoogle Scholar
  17. 17 STENGER, F. Computing the topological degree of a mapping in R~. Numer. Math. 25 (1975), 23-38.Google ScholarGoogle Scholar
  18. 18 STYNES, M. An algorithm for the numerical calculation of the degree of a mapping. Ph.D. dissertation, Dept. of Mathematics, Oregon State Univ., Corvallis, 1977. Google ScholarGoogle Scholar
  19. 19 STYNES, M. An algorithm for numerical calculation of topological degree. Appl. Anal. 9 (1979), 63-77.Google ScholarGoogle Scholar
  20. 20 STYNES, M. A simplification of Stenger's topological degree formula. Numer. Math. 33 (1979), 147-156.Google ScholarGoogle Scholar
  21. 21 STVNES, M. On the construction of sufficient refinements for computation of topological degree. Numer. Math. 37 (1981), 453-462.Google ScholarGoogle Scholar
  22. 22 VRAHATIS, M.N. On the nonzero value of the topological degree for locating roots of systems of nonlinear equations. Tech. Rep. 4, Dept. of Mathematics, Univ. of Patras, Patras, Greece, 1981.Google ScholarGoogle Scholar
  23. 23 VRAHATIS, M.N. Oil the construction of characteristic n-polyhedra for locating roots of systems of nonlinear equations. Tech. Rep. 5, Dept. of Mathematics, Univ. of Patras, Patras, Greece, 1981.Google ScholarGoogle Scholar
  24. 24 VRAHATXS, M.N. The topological degree for the generalized method of bisection. Tech. Rep. 6, Dept. of Mathematics, Univ. of Patras, Patras, Greece, 1981.Google ScholarGoogle Scholar
  25. 25 VRAHATIS, M.N. An error estimation for the method of bisection in Rn. Bull. Greek Math. Sac. 27 (1986), 161-174.Google ScholarGoogle Scholar
  26. 26 VRAHATIS, M. N., AND BOUNTIS, T.C. A convergence-improving iterative method for computing periodic orbits near bifurcation points. Submitted for publication.Google ScholarGoogle Scholar
  27. 27 VRAHATIS, M. N., AN~ IORDANIDIS, K.I. A rapid generalized method of bisection for solving systems of non-linear equations. Numer. Math. 49 (1986), 123-138. Google ScholarGoogle Scholar

Index Terms

  1. Solving systems of nonlinear equations using the nonzero value of the topological degree

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader