CURRICULUM VITAE: GERARD G. L. MEYER
Personal
Citizenship: U. S. A.
Marital Status: Married, two sons.
Position: Professor and Chair, Electrical and Computer Engineering Department, The
Business Address: 105 Barton Hall, The Johns Hopkins University,
Telephone: (410)-516-7003
Fax: (410)-516-5566
e-mail: gglmeyer@jhu.edu
Education
Ecole Nationale
Superieure d'Ingenieur Arts et Metiers, Paris, France,
1958-1962, Diplome d'Ingenieur, 1962.
Ecole Superieure d'Electricitee, Paris, France, 1962-1964,
Diplome d'Ingenieur, 1964.
Research Interests
Optimization Algorithms: Our interests in optimization algorithms are primarily directed towards the synthesis of efficient algorithms for large scale, ill conditioned problems, and the systematic methods needed to analyze their convergence. In that general area, and in collaboration with Dr. L.J. Podrazik from the Center for Computing Sciences of the Institute for Defense Analysis, I am working on maximizing highly non-linear functions on cartesian products of unit simplices using radial projection methods.
Modelling of Parallel Machines: The effective use of modern computing machines requires the synthesis of the appropriate models to quantify machine behavior as a function of algorithm implementation. The challenge lies in proposing models that are as simple as possible, and yet precise enough to allow the determination of algorithm implementation parameters with the desired accuracy. In the context of the Department of Defense High Performance Computing Program, we have access to most types of parallel machines, that is vector processors (Cray 90), distributed memory machines (Thinking Machine CM5, Cray T3D), message passing multicomputers (Intel Paragon, IBM SP2) shared memory machines (SGI Challenge). Our research efforts to date have resulted in useful models for both synchronized distributed memory machines and shared memory machines.
Parameterized Parallel Numerical Algorithms: Rapid solution of linear algebra problems is fundamental in many real time situations, for example adaptive beam forming. In that context it is necessary to have algorithms that possess the degree and type of parallelism that matches the target hardware. In order to solve that difficulty, we are investigating a parameterized approach to algorithm synthesis that is based on the segmenting of the computations into arithmetic grains, and in parameterizing the assignment of the grains to the computational streams. The approach has been used on the parallel QR factorization problem, using both the fast Givens and Householder methods, and on the SOR algorithms (Jacobi, red-black, and Gauss-Seidel) for solving elliptic partial differential equations.
Professional Experience
1964-1966: Research Engineer, Service Technique des
Constructions et Armes Navales, 16 rue Emeriau, Paris
15, France.
1967-1970: Research Assistant Department of Electrical Engineering and Computer
Sciences,
1970-1971: Research Associate, Department of Electrical Engineering,
1971-1972: Assistant Professor,
1972-1973: Visiting Assistant Professor, Electrical Engineering Department, The
1973-1976: Assistant Professor, Electrical Engineering Department, The
1976-1977: Visiting Associate Professor, Electrical Engineering Department,
1976-1981: Associate Professor, Electrical Engineering Department, The
1981- : Professor, Electrical and Computer Engineering Department, The
1999- : Chair, Electrical and Computer Engineering
Department, The
Present Duties
Teaches courses in digital logic, computer architecture, parallel computing, algorithm design, and perform research in Optimization theory, Optimal control, Numerical methods for optimization, Theory of convergence for iterative procedures, Anti-jamming schemes for iterative procedures, Parallel computer architectures, Parallel implementations of algorithms for optimal control problems, System level fault models, Fault analysis and algorithms for fault diagnosis, Error detection schemes for parallel computations, Fault tolerant implementations of algorithms for optimal control problems, Imaging and image processing.
Publications
1.
G. G. L. Meyer and
2.
G. G. L. Meyer and
3. G. G. L. Meyer and H. Payne, An iterative method of solution of the algebraic Riccati equation, IEEE Trans. on Automatic Control, Vol. AC-17, No. 4, August l972, pp. 550-551.
4. G. G. L. Meyer, A drivable method of feasible directions, SIAM J. on Control, Vol. 11, No. 1, February 1973, pp. 113-118.
5. G. G. L. Meyer, Non-wastefulness of interior iterative procedures, J. Math. Anal. Applications, Vol. 45, No. 2, February 1974, pp. 485-496.
6. G. G. L. Meyer, A segmented algorithm for solving a class of state constrained discrete optimal control problems, IEEE Trans. on Automatic Control, Vol. AC-19, No. 2, April 1974, pp. 134-136.
7. G. G. L. Meyer, Algorithm model for penalty functions-type iterative procedures, J. of Computer and System Sciences, Vol. 9, No. 1, August 1974, pp. 20-30.
8. G. G. L. Meyer, Accelerated Frank-Wolfe algorithms, SIAM J. on Control, Vol. 12, No. 4, November 1974, pp. 655-633.
9. G. G. L. Meyer, A canonical structure for iterative procedures, J. Mathematical Analysis and Applications, Vol. 52, No. 1, October 1975, pp. 120-128.
10. G. G. L. Meyer, A systematic approach to the synthesis of algorithms, Numerische Mathematik Vol. 24 (1975), pp. 277-289.
11. G. G. L. Meyer and W. Rugh, editors, Proceedings of the 1976 Conference on Information Sciences and Systems, Baltimore, Maryland, 1976.
12. G. G. L. Meyer, Conditions de convergence pour les algorithmes iteratifs monotone autonomes et nondeterministes, Revue Francaise d'Automatique, Informatique et Recherche Operationnelle, Serie Rouge, Analyse Numerique, Vol. 11, No. 1, April 1977, pp. 61-74.
13. G. G. L. Meyer, A finitely solvable class of approximating problems, SIAM J. on Control and Optimization Vol. 15, No. 3, May 1977, pp. 400-406.
14. G. G. L. Meyer, Convergence conditions for a type of algorithm model, SIAM J. on Control and Optimizations, Vol. 15, No. 5, August 1977, pp. 779-784.
15. G. G. L. Meyer, Effectiveness of multi-microprocessor networks for solving the nonlinear Poisson equation, in High Speed Computer and Algorithm Organization, D. J. Kuck, D. H. Lawrie and A. H. Sameh Ed., Academic Press, Inc., New York 1977, pp. 323-326.
16. G.
G. L. Meyer, Methods of feasible directions with increased gradient memory, Lecture
Notes in Control and Information Science, Vol. 7, Part 2, Edited by J.
Stoer,
17. G. G. L. Meyer and G. Masson, An efficient fault diagnosis algorithm for symmetric multiple processor architectures, IEEE Trans. on Computers, Vol. C-27, No. 11, November 1978, pp. 1059-1063.
18. G. G. L. Meyer and C. R. Westgate, editors, Proceedings of the 1979 Conference on Information Sciences and Systems, Baltimore, Maryland 1979.
19. G. G. L. Meyer, Asymptotic properties of sequences iteratively generated by point-to-set maps, Mathematical Programming Studies, Point-to-Sets Maps and Mathematical Programming, Vol. 10 (1979), pp. 115-127.
20. G. G. L. Meyer and R. C. Raup, On the structure of cluster point sets of iteratively generated sequences, J. Optimization Theory and Applications, Vol. 28, No. 3, July 1979, pp. 353-362.
21. G. G. L. Meyer, A fault diagnosis algorithm for asymmetric modular architectures, IEEE Trans. on Computers, Vol. C-30, No. 1, January 1981, pp. 81-83.
22. G. G. L. Meyer and W. J. Rugh, editors, Proceedings of the 1981 Conference on Information Sciences and Systems, Baltimore, Maryland 1981.
23. G. G. L. Meyer and A. J. David, Unstructured mean iterative processes in reflexive Banach spaces, SIAM J. Control and Optimization, Vol. 21, No. 1, January 1983, pp. 140-152.
24. G. G. L. Meyer, An efficient method of feasible directions, SIAM J. Control and Optimization, Vol. 21, No. 1, January 1983, pp. 153-162.
25. G. G. L. Meyer, A diagnosis algorithm for the BGM system level fault model, IEEE Trans. Computers, Vol. C-33, No. 8, August 1984, pp. 756-758.
26. G. G. L. Meyer and H. L. Weinert, Parallel algorithms and computational structures for linear estimation problems, in Statistical Signal Processing, E. J. Wegman and J. G. Smith, Ed., Marcel Dekker, Inc., New York, New York, 1984, pp. 507-516.
27. G. G. L. Meyer, Convergence properties of relaxation algorithms, Mathematical Programming, Vol. 31, No. 1, January 1985, pp. 15-24.
28. G. G. L. Meyer and M. J. O'Donnell, editors, Proceedings of the 1985 Conference on Information Sciences and Systems, Baltimore, Maryland, 1985.
29. G. G. L. Meyer and H. L. Weinert, On the design of fault-tolerant signal detectors, IEEE Trans. Acoustics, Speech and Signal Processing, Vol. ASSP-34, No. 4, August 1986, pp. 973-978.
30. G. G. L. Meyer and L. J. Podrazik, A parallel first-order linear recurrence solver, J. Parallel and Distributed Computing, Vol. 4, 1987, pp. 117-132.
31. G. G. L. Meyer, Convergence of relaxation algorithms by averaging, Mathematical Programming, Series A, Vol. 40, No. 2, February 1988, pp. 205-212.
32. G. G. L. Meyer and L. J. Podrazik, Parallel iterative algorithms for optimal control, Parallel Processing for Scientific Computing, G. Rodrigue Ed., SIAM Publications, Philadelphia, PA, 1989, pp. 250-254.
33. G. G. L. Meyer and M. A. Kennedy, The PMC system level fault model: cardinality properties of the implied faulty sets, IEEE Trans. on Computers, Vol. 38, No. 3, March 1989, pp. 478-480.
34. G. G. L. Meyer and H. L. Weinert, editors, Proceedings of the 1989 Conference on Information Sciences and Systems, Baltimore, Maryland, 1989.
35. G. G. L. Meyer and M. Pascale, A family of parallel QR factorization algorithms, Special Issue of Concurrency, Practice and Experience, Vol. 8 (6), July-August 1996, pp. 461-473.
36. G. G. L. Meyer and H. L. Weinert, editors, Proceedings of the 1997 Conference on Information Sciences and Systems, Baltimore, Maryland March 19, 20 and 21, 1997.
37. G. G. L. Meyer and J. Carrig Jr., Efficient Householder QR factorization for superscalar processors, ACM Transactions on Mathematical Software, Vol. 23, No. 3, September 1997, pp. 362-378.
38. G. G. L. Meyer and J. J. Carrig, A parameterized ordering for cache-, register-, and pipeline-efficient Givens QR decomposition, Advances in Computational Mathematics, Vol. 10, 1999, pp. 97-113.
39. G. G. L. Meyer and M. V. Pascale, Elliptic equations, The Encyclopedia of Electrical and Electronics Engineering, John Wiley and Sons, Inc., June 1999, Vol. 7, pp. 47- 54.
40. I. N. Dunn, G. G. L. Meyer, Parallel QR Factorization for Hybrid Message Passing/Shared memory Operation, J. Franklin Institute, Vol. 338, Issue 5, August 2001, pp. 601-613.
41. I. N. Dunn, G. G. L. Meyer, QR factorization for message passing and shared memory machines, Parallel Computing, Vol. 28, Issue 11, November 2002, pp. 1507-1530.
42. I. N. Dunn, G. G. L. Meyer, A Parallel Algorithm Synthesis Procedure for High-Performance Computer Architectures, Kluwer Publishing, 2003.
43. M. Ordowski, G. G. L. Meyer, Geometric Linear Discriminant Analysis for Pattern Recognition, Pattern
Recognition, Vol. 37, No. 3, March 2004, pp. 421-428.
Other Publications
1.
G. G. L. Meyer and
2.
G. G. L. Meyer, An open loop method of feasible
directions for the solution of optimal control problems, Proceedings of the
of the Sixth Annual Princeton Conf. on Information Sciences and Systems,
3.
G. G. L. Meyer, Characteristic set of a canonical
structure, Symposium on Nonlinear Programming, The
4.
G. G. L. Meyer, Necessary convergence conditions for a
class of interior methods, Proceedings of the Seventh Princeton Conference
on Information Sciences and Systems,
5.
G. G. L. Meyer, Inner loops in interior methods, VIII
International Symposium on Mathematical Programming,
6.
G. G. L. Meyer, A segmented algorithm for solving a
class of state constrained discrete optimal control problems, Proceedings
of the IEEE Decision and Control Conference,
7. G. G. L. Meyer, The removal of an uncontrollable inner loop from a specific iterative procedure, Proceedings of the Eighth Annual Princeton Conference on Information Sciences and Systems, March 28-29, 1974, Princeton, New Jersey, pp. 157-158.
8. G. G. L. Meyer, Accelerated Frank-Wolfe algorithms, Proceedings Joint Automatic Control Conference, June 19-21, 1974, Austin, Texas, pp. 656-661.
9. G. G. L. Meyer, Finite solvability of a family of approximating problems, SIAM Fall Meeting, Alexandria, Virginia, October 23-24, 1974.
10. G. G. L. Meyer, Transformations for finite memory algorithms, Proceedings of the 1975 Conference on Information Sciences and Systems, April 2-4, 1975, Baltimore, Maryland.
11. G. G. L. Meyer, Finite solvability of a family of approximating problems, 47th National ORSA /TIMS Meeting, April 30-May 2, 1975, Chicago, Illinois.
12. G. G. L. Meyer, Fail resistant multiprocessing networks, Proceedings of the Thirteenth Annual Allerton Conference on Circuit and System Theory, October 1-3, 1975, Urbana, Illinois, pp. 93-102.
13. G. G. L. Meyer and G. Masson, An efficient fault diagnosis algorithm for multiple processor architecture, Proceedings of the 1976 Conference on Information Sciences and Systems, March 31, April 1-2, 1976, Baltimore, Maryland, pp. 249-251.
14. G. G. L. Meyer, A multi-microprocessor architecture for SOR-type algorithms, Proceedings of the Fourteenth Annual Allerton Conference on Circuit and System Theory, September 29-30, October 1, 1976, Urbana, Illinois, pp. 1102-1111.
15. G. G. L. Meyer, A finitely solvable class of approximating problems, Proceedings of the 1976 IEEE Conference on Decision and Control, December 1-3, 1976, Clearwater Beach, Florida, pp. 478-482.
16. G.
G. L. Meyer and J. Biondi, A parallel Jacobi algorithm for solving the
eigenproblem on a multi-microprocessor network, Proceedings of the 1977
Conf. on Information Sciences and Systems, March 30-31,
17. G. G. L. Meyer, Fault diagnosis of modular networks with a small number of faults, Proceedings of the Fifteenth Annual Allerton Conference on Communication, Control, and Computing, September 28-30, 1977, Urbana, Illinois, pp. 727-731.
18. G.
G. L. Meyer, Convergence conditions for a type of algorithm schema, Proceedings
of the 1977
IEEE Conference on Decision and Control,
19. G. G. L. Meyer and R. C. Raup, Cluster point sets of iteratively generated sequences in E sup n, Proceedings of the 1977 IEEE Conference on Decision and Control, December 7-9, 1977, New Orleans, Louisiana, pp. 397-399.
20. G.
G. L. Meyer and R. C. Raup, One dimensional mean value methods in iterations, Proceedings of
the 17th IEEE Conference on Decision and Control,
21. G.
G. L. Meyer and A. J. David, A map independent one-dimensional averaging
schema, Proceedings of the 4th International Symposium on the Mathematical
Theory of Networks and Systems,
22. G. G. L. Meyer, An efficient method of feasible directions, Tenth International Symposium on Mathematical Programming, Montreal, August 27-31, 1979, Montreal, Canada.
23. G.
G. L. Meyer, Fault diagnosis algorithms for asymmetric modular architectures,
24. G. G. L. Meyer and A. J. David, Robust iterative algorithms, Proceedings of the Seventeenth Annual Allerton Conference on Communication, Control and Computing, October 10-12, 1979, Urbana, Illinois, pp. 937-939.
25. G.
G. L. Meyer and A. J. David, Input-output behavior of the one-dimensional mean
iterative process, Proceedings of the Fourteenth Annual Conference on
Information Sciences and Systems,
26. G. G. L. Meyer, Synthesis of optimization algorithms by concatenation, Proceedings of the Nineteenth IEEE Conference on Decision and Control, December 10-12, 1980, Albuquerque, New Mexico.
27. G.
G. L. Meyer, Transmission model for hybrid fault diagnosis, Workshop on
Analog Fault Diagnosis, University of Notre Dame,
28. G. G. L. Meyer and B. L. Havlicsek, Morphic properties of deterministic and nondeterministic fault models, Proceedings of the Nineteenth Annual Allerton Conference on Communication, Control and Computing, Allerton House, Monticello, Illinois, September 30- October 2, 1981.
29. G.
G. L. Meyer and A. J. David, Synthesis of a class of fixed point algorithms:
the deterministic case, Proceedings of the 20th IEEE Conference on Decision
and Control,
30. G. G. L. Meyer and B. L. Havlicsek, Totally morphic HM fault model, Proceedings 16th Annual Conference on Information Sciences and Systems, Princeton, New Jersey, March 17-19, 1982.
31. G.
G. L. Meyer and H. L. Weinert, Computational structures for parallel linear
regression, Proceedings 16th Annual Conference on Information Sciences and
Systems,
32. G. G. L. Meyer and H. L. Weinert, Parallel algorithms and computational structures for linear estimation problems, 1982 Office of Naval Research Workshop on Signal Processing in the Ocean Environment, Annapolis, Maryland, May 11-14, 1982.
33