Curriculum Vitae and List of Publications of Victor Eijkhout Personal Data Name: Victor Lambert Eijkhout Address: Department of Computer Science University of Tennessee 107 Ayres Hall Knoxville, TN 37996, USA eijkhout@cs.utk.edu, +1 615 974 8298 (work), +1 615 558 3069 (home) Previous employment: 1992-current: University of Tennessee, researching and writing parallel iterative methods library fall 1990-1991: CSRD, University of Illinois, parallel programming of algebraic multilevelmethods, incomplete factorizations till 1990: Graduate studies with O.Axelsson at the University of Nijmegen, the Netherlands Career objective: To apply my knowledge and abilities in numerical mathematics and parallel computing to practical problems. Degree: Ph.D. in mathematics and computer science from the Catholic University in Nijmegen, the Netherlands. Advisor: professor Owe Axelsson. Obtained May 1990. Born: 29th November 1959, Arnhem, the Netherlands. Citizenship: Dutch, wanting to apply for US permanent residency. Curriculum Vitae I have studied mathematics and computer science at the university in Nijmegen, the Netherlands, specializing in numerical analysis under professor O. Axelsson. During my study I have been employed by the computer science department for work on the Elan interpreter, and by the AI-lab of the department of psychology for work on the automated analysis of expressions of opinion. %Near the end of my studies I received my %license to teach, which is required for secondary schools %in the Netherlands. After a short intermission following my graduation in October 1984, I started my Ph.D research under professor O. Axelsson in April 1985 on vectorizable and parallelizable preconditioners for the conjugate gradient method. The first two years my research was funded by the Control Data Pacer Fellowship program, and in that time I wrote code for the Cyber 205. I received my Ph.D. in May 1990. From September 1990 through December 1991 I have been employed as Visiting Senior Computer Scientist at the Center for Supercomputing Research and Development of the University of Illinois at Urbana-Champaign, where I did research under professor Ahmed Sameh in ordering strategies for incomplete factorizations, and in implementing algebraic multilevel methods on the Cedar parallel computer. In addition, I have been involved in the Perfect Benchmarks project for performance evaluation. From January 1992 I have been employed by the Computer Science Department of the University of Tennessee in Knoxville under professor Jack Dongarra, to write the iterative solution methods component of ScaLaPack, a linear algebra package for massively parallel, scalable, computer architectures. The current target architectures for my code are Intel hypercubes (the 64 node iPSC/2 and the 128 node iPSC/860 at Oak Ridge National Lab) as well as the Intel Paragon, and networks of Unix workstations connected through PVM. Skills Many years programming experience in Fortran, Lisp, Algol68; operating systems VM/CMs and Unix (extensive use of shell utilities); expert knowledge of TeX/LaTeX (I have written a book, `TeX by Topic', Addison-Wesley 1992). Good communication skills, verbally and in writing. List of Publications V. Eijkhout, Scalar recurrences on chainable pipeline architectures, Report CNA-202, Center for Numerical Analysis; University of Texas at Austin, 1985. O. Axelsson, V. Eijkhout, A note on the vectorization of scalar recursions, Parallel Computing, 3(1986), 73-83. A. Axelsson, V. Eijkhout, Robust vectorizable preconditioners for three-dimensional elliptic difference equations with anisotropy, in: Algorithms and Applications on Vector and Parallel Computers, H.J.J. te Riele, Th.J. Dekker and H.A. van der Vorst (editors), North-Holland 1987, 279--306. V. Eijkhout, A general formulation for incomplete blockwise factorizations, Communications in Applied Numerical Methods, 4(1988), 161--164 V. Eijkhout, B. Polman, Decay rates of inverses of banded M-matrices that are near to Toeplitz matrices, Linear Algebra and its Applications, 109(1988), 247-277. O. Axelsson, V. Eijkhout Vectorizable Preconditioners for Elliptic Difference Equations in Three Space Dimensions Journal of Computational and Applied Mathematics, 27(1989), 299--321. V. Eijkhout, P. Vassilevski Positive Definiteness Aspects of Vectorizable Preconditioners Parallel Computing, 10(1989), 93--100. O. Axelsson, V. Eijkhout, B. Polman, P. Vassilevski, Incomplete block-matrix factorization iterative methods for convection-diffusion problems Bit, 29(1989), 867--889. V. Eijkhout, S. Margenov Preconditioned Iterative Solution of Spline Finite Element Systems, Mathematica Balkanica, 4(1990), 350--367. V. Eijkhout, Implementation of 5-Point/9-Point Multi-level Methods on Hypercube Architectures, Proceedings of the 1990 International conference on Supercomputing, Amsterdam, ACM press, 291--295. V. Eijkhout, Analysis of Parallel Incomplete Point Factorizations, Linear Algebra and its Applications, 154--156(1991), 723--740. V. Eijkhout, Beware of unperturbed modified incomplete point factorizations, in the Proceedings of the IMACS International Symposium on Iterative Methods in Linear Algebra, Brussels Belgium, Robert Beauwens and Pieter de Groen, editors, 1992. V. Eijkhout, P. Vassilevski, The Role of the Strengthened C.B.S.-inequality in Multi-Level Methods, SIAM Review, 33(1991), 405--419. O. Axelsson, V. Eijkhout, A Nested Recursive Two-level Factorization Method for Nine-point Difference Matrices, SIAM Journal of Scientific and Statistical Computing, 12(1991), 1373--1400. V. Eijkhout, Lapack Working Note 50: Distributed Sparse Data Structures for Linear Algebra Operations, Computer Science Department, University of Tennessee, report 92-169, 1992. V. Eijkhout, Lapack Working Note 51: Qualitative Properties of the Conjugate Gradient and Lanczos Methods in a Matrix Framework, Computer Science Department, University of Tennessee, report 92-170, 1992, submitted. E.F. D'Azevedo, V.L. Eijkhout, and C.H. Romine, Lapack Working Note 56: Reducing communication costs in the conjugate gradient algorithm on distributed memory multiprocessor, Computer Science Department, University of Tennessee, Knoxville, report 93-185, 1993, submitted. % V. Eijkhout, %Characterization of polynomial iterative methods, %Lapack Working Note. R. Barrett et al, Templates for the solution of linear systems: building blocks for iterative methods, SIAM, Philadelphia 1994. Richard Barrett, Michael Berry, Jack Dongarra, Victor Eijkhout and Charles Romine, Algorithmic bombardment for the iterative solution of linear systems: a poly-iterative approach, LAPACK working note 76, submitted. Victor Eijkhout, A Library of Distributed Iterative Linear System Solvers, in: IMACS '94 Proceedings (14th World Congress on Computation and Applied Mathematics), ed: W.F. Ames, volume 4, pp 99--101 Victor Eijkhout and Roldan Pozo, Basic concepts for distributed sparse linear algebra operations, LAPACK working note 77. Victor Eijkhout, Computational variants of the CGS and BiCGstab methods, Lapack Working Note 78. Victor Eijkhout and Roldan Pozo, Data structures and algorithms for distributed sparse matrix operations, LAPACK working note.