A Robust, Parallel Homotopy Algorithm for the Symmetric Tridiagonal Eigenproblem

1998 ◽  
Vol 20 (3) ◽  
pp. 1016-1032 ◽  
Author(s):  
Michael H. Oettli
Keyword(s):  
2013 ◽  
Vol 22 (1) ◽  
pp. 41-46
Author(s):  
ANDREI BOZANTAN ◽  
◽  
VASILE BERINDE ◽  

This paper describes the main aspects of the ”piecewise-linear homotopy method” for fixed point approximation proposed by Eaves and Saigal [Eaves, C. B. and Saigal, R., Homotopies for computation of fixed points on unbounded regions, Mathematical Programming, 3 (1972), No. 1, 225–237]. The implementation of the method is developed using the modern programming language C# and then is used for solving some unconstrained optimization problems. The PL homotopy algorithm appears to be more reliable than the classical Newton method in the case of the problem of finding a local minima for Schwefel’s function and other optimization problems.


1992 ◽  
Author(s):  
Emmanuel G. Collins ◽  
Stephen Richter ◽  
Lawrence D. Davis

2002 ◽  
Vol 40 (2) ◽  
pp. 578-600 ◽  
Author(s):  
T. Y. Li ◽  
Xiaoshen Wang ◽  
Mengnien Wu

1996 ◽  
Vol 2 (2) ◽  
pp. 101-133 ◽  
Author(s):  
Emmanuel G. Collins ◽  
Sidney S. Ying ◽  
Wassim M. Haddad ◽  
Stephen Richter

1980 ◽  
Vol 19 (1) ◽  
pp. 78-91 ◽  
Author(s):  
G. van der Laan ◽  
A. J. J. Talman

Sign in / Sign up

Export Citation Format

Share Document