A globally convergent algorithm for computing fixed points of C2 maps

Applied Mathematics and Computation

Volumn 5, Issue 4, 1979, Pages 297-311

  Watson, Layne T ^a  

^a MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000748675     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/0096-3003(79)90020-1     Document Type: Article

References (21)

1. Linear least squares solutions by Householder transformations
2. Finding zeros of maps homotopy methods that are constructive with probability one
3. Computing Kakutani fixed points
4. Homotopies for the computation of fixed points
5. Homotopies for computation of fixed points on unbounded regions
6. The solution of systems of piecewise linear equations
7. Numerical solution of bifurcation and nonlinear eigenvalue problems
8. A constructive proof of the Brouwer fixed-point theorem and computational results
9. Zeros of nonlinear functions
10. Dependence of solutions of nonlinear systems on a parameter
11. Applications and extensions of an algorithm to compute fixed points of upper semicontinuous mappings
12. On the convergence rate of algorithms for solving equations that are based on methods of complementary pivoting
13. The approximation of fixed points of a continuous mapping
14. Solving nonstiff ordinary differential equations—The state of the art
15. The art of writing a Runge-Kutta code: RKF45