Gerard Meyer received his PhD in 1970 from the University of California, Berkley, and soon joined the Department of Electrical and Computer Engineering in 1972. Meyer is developing (1) synthesis methods for optimization algorithms to be used on large scale, ill conditioned problems; (2) analysis approaches to study the convergence of these algorithms and finally (3) systematic implementation schemes for both synchronized distributed memory and shared memory machines. These approaches have been used on factorization problems, pattern recognition problems and robust anomaly detection.
