Since 1990, Dr. Henk A. van der Vorst is a full professor in applied mathematics with the Mathematical Institute of Utrecht University. Earlier he held a similar position at the Delft University of Technology (1984-1990). He accepted early retirement by the end of 2005.
He has made some well-known contributions to algorithms for large sparse problems: 
ILU and ICCG (together with Meijerink), Bi-CGSTAB, GMRESR (with Vuik), as special cases of so-called Krylov methods, and Jacobi-Davidson algorithms (with Sleijpen) for eigenproblems.
According to ISI, the Bi-CGSTAB paper was the most cited paper in the field of mathematics in the 1990s.

Together with Van der Sluis he studied the convergence behavior of the Conjugate Gradients method and the convergence of eigenvalue approximations in the Lanczos method.  He also contributed to new parallel algorithms: truncated Neumann series preconditioning, incomplete twisted factorizations, and the so-called "vdv" ordering. He is involved in the Templates projects for linear problems and eigenproblems.
 

Member of the Royal Netherlands Academy of Arts and Sciences
Member of NFTW (Netherlands Academy of Engineering)
Ridder in de Orde van de Nederlandse Leeuw
Holst Memorial Lecture Award (November 22, 2007)