Probability-one homotopies in computational science

Journal of Computational and Applied Mathematics

Volumn 140, Issue 1-2, 2002, Pages 785-807

  Watson, Layne T ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

Globally convergent homotopy method; Mathematical software; Nonlinear equations; Polynomial systems

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; NONLINEAR EQUATIONS; POLYNOMIALS; PROBABILITY;

HOMOTOPY ALGORITHMS;

COMPUTATIONAL METHODS;

ALGORITHM;

EID: 0036501940     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(01)00473-3     Document Type: Article

References (13)

1. Application of new homotopy continuation techniques to variable geometry trusses
2. Finding zeros of maps: Homotopy methods that are constructive with probability one
3. Artificial parameter homotopy methods for the DC operating point problem
4. Homotopy approach for solving constrained optimization problems
5. Numerical linear algebra aspects of globally convergent homotopy methods
6. HOMPACK: A suite of codes for globally convergent homotopy algorithms
7. Globally convergent homotopy algorithms for nonlinear systems of equations
8. Theory of globally convergent probability-one homotopies for nonlinear programming
9. Modern homotopy methods in optimization
10. Algorithm 777: HOMPACK90: A suite of Fortran 90 codes for globally convergent homotopy algorithms
11. Algorithm 801: POLSYSP: A partitioned linear product homotopy code for solving polynomial systems of equations