Dianne O'Leary
Professor Emerita
2160 Iribe Center
(301) 405-2678
(301) 405-6707
Education:
Ph.D., Stanford University (Computer Science)
Special Awards/Honors:
ACM Fellow, CMPS Board of Visitors Distinguished Faculty Award, 2011 Norbert Wiener Lecturer
Biography:
Dianne Prost O'Leary is a Distinguished University Professor Emerita of computer science, and also holds joint appointments in UMIACS and in the Applied Mathematics and Statistics and Scientific Computing Program.
O'Leary's research focuses on computational linear algebra and optimization, with applications including solution of ill-posed problems, image deblurring, information retrieval, protein configuration, and quantum computing.
She has authored two books, more than 100 research publications on numerical analysis and computational science, and 30 publications on education and mentoring. Perhaps her most widely-read publication is an online guide called, "Graduate Study in the Computer and Mathematical Sciences: A Survival Manual." Twenty-one students have received doctorates under her direction.
O'Leary is a member of AWM and a Fellow of SIAM and ACM. She was awarded a Doctor of Mathematics degree, honoris causa, from the University of Waterloo in 2005; received the Board of Visitors Distinguished Faculty Award, College of Computer, Mathematical, and Physical Sciences, University of Maryland, in 2007; and was chosen to be the 2008 AWM-SIAM Sonia Kovalevsky Lecturer.
She has chaired the program committees of major conferences and has organized two mentoring workshops. O'Leary is editor-in-chief of the SIAM Journal on Matrix Analysis and Applications, and co-edits the column, "Your Homework Assignment" for Computing in Science and Engineering.
She earned a B.S. in mathematics with a physics minor from Purdue University and a doctorate in computer science from Stanford University.
Go here to view O'Leary's academic publications on Google Scholar.
Publications
1995
1995. The SVD in Image Restoration. SVD and Signal Processing III: Algorithms, Architectures, and ApplicationsSVD and Signal Processing III: Algorithms, Architectures, and Applications. :315-322.
1995. What is Fundamental for Markov Chains: First Passage Times, Fundamental Matrices, and Group Generalized Inverses. Proceedings of the Second International Workshop on Markov ChainsProceedings of the Second International Workshop on Markov Chains. :151-161.
1995. Why Broyden's Nonsymmetric Method Terminates on Linear Equations. SIAM Journal on Optimization. 5:231-235.
1994
1994. The linear algebra of block quasi-newton algorithms. Linear Algebra and its Applications. 212–213:153-168.
1994. Parallel Computing: Emerging from a Time Warp. IEEE Computational Science & Engineering. 1(4):1,15-1,15.
1994. Confidence Intervals for Discrete Approximations to Ill-Posed Problems. The Journal of Computational and Graphical Statistics. 3:67-96.
1994. Some Themes in Gene H.Golub's Work on Iterative Methods. Recent Advances in Iterative MethodsRecent Advances in Iterative Methods. 60:1-11.
1994. URV ESPRIT for tracking time-varying signals. Signal Processing, IEEE Transactions on. 42(12):3441-3448.
1994. Regularization by Truncated Total Least Squares. Proceedings of the Fifth SIAM Conference on Applied Linear Algebra. :250-254.
1994. Regularization of Ill-Posed Problems in Image Restoration. Proceedings of the Fifth SIAM Conference on Applied Linear AlgebraProceedings of the Fifth SIAM Conference on Applied Linear Algebra. :102-105.
1993
1993. Iterative Methods for Finding the Stationary Vector for Markov Chains. Linear Algebra, Markov Chains, and Queuing ModelsLinear Algebra, Markov Chains, and Queuing Models. 48:125-136.
1993. The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems. SIAM Journal on Scientific Computing. 14(6):1487-1503.
1993. An adaptive ESPRIT based on URV decomposition. Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on. 4:37-40vol.4-37-40vol.4.
1993. A Krylov multisplitting algorithm for solving linear systems of equations. Linear Algebra and its Applications. 194:9-29.
1992
1992. Preconditioning parallel multisplittings for solving linear systems of equations. Proceedings of the 6th international conference on Supercomputing. :478-484.
1992. Constrained Matrix Sylvester Equations. SIAM Journal on Matrix Analysis and Applications. 13(1):1-9.
1992. On the Precise Loop Transfer Recovery and Transmission Zeroes. First IEEE Conference on Control ApplicationsFirst IEEE Conference on Control Applications.
1992. The Design of Reduced Order Observers with Precise Loop Transfer Recovery. AIAA Journal of Guidance, Control, and Dynamics. 15:1320-1326.
1991
1991. Considerations on Loop Transfer Recovery for Non-minimum Phase Plants. Proceedings of the AIAA Aircraft Design Systems and Operations MeetingProceedings of the AIAA Aircraft Design Systems and Operations Meeting. AIAA-91-3086
1991. Yet another polynomial preconditioner for the conjugate gradient algorithm. Linear Algebra and its Applications. 154–156:377-388.
1991. The Design of Reduced Order Luenberger Observers with Precise LTR. Proceedings of the AIAA Meeting on Guidance, Navigation and ControlProceedings of the AIAA Meeting on Guidance, Navigation and Control. AIAA-91-2731
1990
1990. Robust Regression Computation Using Iteratively Reweighted Least Squares. SIAM Journal of Matrix Analysis and Applications. 11:466-480.
1990. Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices. Journal of Computational Physics. 90(2):497-505.
1990. Parallel QR factorization by householder and modified Gram-Schmidt algorithms. Parallel Computing. 16(1):99-112.
1990. On bounds for scaled projections and pseudoinverses. Linear Algebra and its Applications. 132:115-117.
1989
1989. Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976. SIAM Review. 31(1):50-102.
1989. Domino: A Transportable System for Parallel Processing. Parallel Processing and Medium-Scale Multiprocessors (Proceedings of a 1986 Conference)Parallel Processing and Medium-Scale Multiprocessors (Proceedings of a 1986 Conference). :25-34.
1988
1988. Some algorithms for approximating convolutions. Computer Vision, Graphics, and Image Processing. 41(3):333-345.
1987
1987. Parallel implementation of the block conjugate gradient algorithm. Parallel Computing. 5(1–2):127-139.
1987. A note on the capacitance matrix algorithm, substructuring, and mixed or neumann boundary conditions. Applied Numerical Mathematics. 3(4):339-345.
1987. Fine and Medium Grained Parallel Algorithms for Matrix QR Factorization. Algorithms and Applications on Vector and Parallel ComputersAlgorithms and Applications on Vector and Parallel Computers. :347-349.
1987. From Determinacy to Systaltic Arrays. Computers, IEEE Transactions on. C-36(11):1355-1359.
1987. Systolic Arrays for Matrix Transpose and Other Reorderings. Computers, IEEE Transactions on. C-36(1):117-122.
1986
1986. Confidence Intervals for Inequality-Constrained Least Squares Problems, with Applications to Ill-Posed Problems. SIAM Journal on Scientific and Statistical Computing. 7:473-489.
1986. Assignment and scheduling in parallel matrix factorization. Linear Algebra and its Applications. 77:275-299.
1985
1985. Multi-splittings of Matrices and Parallel Solution of Linear Systems. SIAM Journal on Algebraic and Discrete Methods. 6:630-640.
1985. Data-flow algorithms for parallel matrix computation. Communications of the ACM. 28(8):840-853.
1984
1984. Ordering Schemes for Parallel Processing of Certain Mesh Problems. SIAM Journal on Scientific and Statistical Computing. 5:620-632.
1983
1983. Analysis of Relaxation Processes: the Two Node, Two Label Case. IEEE Transactions on Systems, Man, and Cybernetics. SMC-13:618-623.
1983. Multi-resolution relaxation. Pattern Recognition. 16(2):223-230.
1983. Digital Image Compression by Outer Product Expansion. Communications, IEEE Transactions on. 31(3):441-444.
1982
1982. An Optimization Approach to Edge Reinforcement. IEEE Transactions on Systems, Man, and Cybernetics. SMC-12:551-553.
1982. A Discrete Newton Algorithm for Minimizing a Function of Many Variables. Mathematical Programming. 23:20-33.
1982. Image Smoothing and Segmentation by Cost Minimization. IEEE Transactions on Systems, Man, and Cybernetics. SMC-12:91-96.
1981
1981. Algorithm 572: Solution of the Helmholtz Equation for the Dirichlet Problem on General Bounded Three-Dimensional Regions [D3]. ACM Transactions on Mathematical Software. 7(2):239-246.
1981. A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems. SIAM Journal on Scientific and Statistical Computing. 2(4):474-489.
1981. Classification of Gynecologic Flow Cytometry Data: A Comparison of Methods. Journal of Analytical and Quantitative Cytology. 3:135-142.
1980
1980. Estimating Matrix Condition Numbers. SIAM Journal on Scientific and Statistical Computing. 1:205-209.
1980. A generalized conjugate gradient algorithm for solving a class of quadratic programming problems. Linear Algebra and its Applications. 34:371-399.
1980. The block conjugate gradient algorithm and related methods. Linear Algebra and its Applications. 29:293-322.
1979
1979. Linear programming Problems Arising from Partial Differential Equations. Sparse Matrix Proceedings 1978Sparse Matrix Proceedings 1978. :25-40.
1979. Estimating the Largest Eigenvalue of a Positive Definite Matrix. Mathematics of Computation. 33:1289-1292.
1979. Capacitance Matrix Methods for the Helmholtz Equation on General Three Dimensional Regions. Mathematics of Computation. 33:849-879.
1978
1978. Elastoplastic torsion by quadratic programming. Computer Methods in Applied Mechanics and Engineering. 16(3):361-368.
1978. Numerical Solution of Nonlinear Elliptic Partial Differential Equations by a Generalized Conjugate Gradient Method. Computing. 19:321-339.
1976
1976. A Generalized Conjugate Gradient Method for the Numerical Solution of Elliptic Partial Differential Equations. Sparse Matrix ComputationsSparse Matrix Computations. :309-332.