Charles Van Loan
PhD University of Michigan, 1973
We continue to develop new methods for various Kronecker product
computations. In particular, we have a method for solving the nearest
Kronecker product problem when the factor matrices are subjected to
inhomogeneous constraints. Some applications in signal processing and
Markov processes are solved as a result. Kronecker product descriptions
for various fast wavelet transforms have also been derived. Our aim is to
proceed by analogy to the FFT, where such descriptions have played an
important role in the development of high-performance algorithms.
Both undergraduate texts on computational science that I have been working
on for the last four years are now in production. One is currently being
translated into C in anticipation of the fall semester.
- Computer Science Department Undergraduate Curriculum Committee
- Department Representative, Arts and Sciences Chairs' Meeting
- Freshman Admissions Reader, Arts and Sciences
- Editor, SIAM Journal of Matrix Analysis
- Member, Wilkinson Prize Committee, SIAM
- Member, DiPrima Prize Committee, SIAM
- Member, Organizing Committee, Householder Conference
- Member, Householder Prize Committee
- Applications of the Kronecker product. Linkoping University, Sweden,
January 9, 1995.
- ___. Umea University, Sweden, January 12, 1995.
- Building intuition for computational science. Umea University, Sweden,
January 12, 1995.
- Applications of the Kronecker product. Ohio State University,
April 26, 1995.
- Building intuition for computational science. Ohio State University,
April 27, 1995.
- Optimizing closed loop adaptive optics performance with use of
multiple control bandwidths. Journal of the Optical Society of
America 11 (1994), 2871-86 (with B. Ellerbroek, N. Pitsianis,
and R. Plemmons).
1994-1995 Annual Report Home Page
Departmental Home Page
If you have questions or comments please contact:
Last modified: 25 November 1995 by Denise Moore