Raf Vandebril

Professor
Dept. of Computer Science
KU Leuven
E-mail: Raf.vandebril@cs.kuleuven.be
Page: http://people.cs.kuleuven.be/~raf.vandebril/

Fields of interest:

Numerical Linear Algebra, Manifold Optimization, Eigenvalue Computations, Structured Matrices

Recent publications:
Aurentz J. L., Vandebril R., and Watkins D. S.,
Fast computation of the zeros of a polyno- mial via factorization of the companion matrix,
SIAM Journal on Scientific Computing, 35(1):A255-A269, 2013.

Vandebril R. and Watkins D. S.,
An extension of the QZ algorithm beyond the Hessenberg- upper triangular pencil,
accepted for publication in Electronic Transactions on Numerical Analysis, 2012.

Jeuris B., Vandebril R., and Vandereycken B.,
A survey and comparison of contempo- rary algorithms for computing the matrix geometric mean,
Electronic Transactions on Numerical Analysis, 39:379–402, 2012.

Vandebril R. and Watkins D. S.,
A generalization of the multishift QR-algorithm,
SIAM Journal on Matrix Analysis and its Applications, 33(3):759–779, 2012.

Vannieuwenhoven N., Vandebril R., and Meerbergen K.,
A new truncation strategy for the higher-order singular value decomposition,
SIAM Journal on Scientific Computing, 34(2):1027–2844, 2012.

Meerbergen K. and Vandebril R.,
A reflection on the implicitly restarted Arnoldi me- thod for computing eigenvalues near a vertical line,
Linear Algebra and its Applications, 436(8):2828–2844, 2012.

Vandebril R. and Del Corso G. M.,
A unification of unitary similarity transforms to compressed representations,
Numerische Mathematik, 119(4):641–665, 2011.

Vandebril R.,
Chasing bulges or rotations? A metamorphosis of the QR-algorithm,
SIAM Journal on Matrix Analysis and Applications, 32(1):217–247, 2011.

Vandebril R.,
A unitary similarity transform of a normal matrix to complex symmetric form,
Applied Mathematical Letters, 24(2):160–164, 2011.