Henk van der Vorst

From Wikipedia, the free encyclopedia

Hendrik Albertus (Henk) van der Vorst (born on May 5, 1944) is a Dutch mathematician, Emeritus Professor of Numerical Analysis at Utrecht University. According to the Institute for Scientific Information (ISI), his paper[1] on the Bi-CGSTAB method was the most cited paper in the field of mathematics in the 1990s [2]. He is a member of the Royal Netherlands Academy of Arts and Sciences (KNAW) and the Netherlands Academy of Technology and Innovation [3].

His major contributions include preconditioned iterative methods, in particular the ICCG (Incomplete Cholesky Conjugate Gradient) method (developed together with Koos Meijerink), a version of Preconditioned conjugate gradient method [4][5] the Bi-CGSTAB[1] and (together with Kees Vuik) GMRESR [6] Krylov subspace methods and (together with Gerard Sleijpen) the Jacobi-Davidson method [7] for solving ordinary, generalized, and nonlinear eigenproblems. He has analyzed convergence behavior of the Conjugate Gradient [8] and Lanczos methods. He has also developed a number of preconditioners for parallel computers [9], including truncated Neumann series preconditioner, incomplete twisted factorizations, and the incomplete factorization based on the so-called "vdv" ordering.

He is the author of the book [10] and one of the autors of the Templates projects for linear problems [11] and eigenproblems [12].

[edit] References

  1. ^ a b H.A. van der Vorst (1992), “Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems”, SIAM J. Sci. Stat. Comput. 13(2): 631-644 
  2. ^ in-cites, September 2001, 2001, <http://www.in-cites.com/papers/dr-henk-van-der-vorst.html> 
  3. ^ Members of the Netherlands Academy of Technology and Innovation, <http://www.acti-nl.org/output/webpage.cfm?webpage_id=471> 
  4. ^ J.A. Meijerink, H.A.van der Vorst (1977), “An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix”, Math. Comp. 31: 148–162 
  5. ^ H.A. van der Vorst (1981), “Iterative solution methods for certain sparse linear systems with a non-symmetric matrix arising from PDE-problems”, J. Comput. Phys. 44: 1-19 
  6. ^ H.A. van der Vorst, C. Vuik (1994), “GMRESR: A family of nested GMRES methods”, Numer. Lin. Alg. Appl. 1: 369-386 
  7. ^ G.L.G. Sleijpen and H.A. van der Vorst (1996), “A Jacobi-Davidson iteration method for linear eigenvalue problems”, SIAM J. Matrix Anal. Appl. 17: 401-425 
  8. ^ A. van der Sluis, H.A. van der Vorst (1986), “The rate of convergence of conjugate gradients”, Numer. Math. 48: 543-560 
  9. ^ H.A. van der Vorst (1989), “High performance preconditioning”, SIAM J. Sci. Statist. Comput. 10: 1174-1185 
  10. ^ H.A. van der Vorst (2003), Iterative Krylov Methods for Large Linear systems, Cambridge University Press, Cambridge, ISBN 0521818281 
  11. ^ Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, Accessed January 2008, <http://www.netlib.org/linalg/html_templates/Templates.html> 
  12. ^ Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide, Accessed January 2008, <http://www.cs.ucdavis.edu/~bai/ET/contents.html> 

[edit] External links