Raf Vandebril

Orcid: 0000-0003-2119-8696

Affiliations:
  • Catholic University of Leuven, Belgium


According to our database1, Raf Vandebril authored at least 55 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Rational QZ steps with perfect shifts.
Numer. Algorithms, March, 2024

A new deflation criterion for the QZ algorithm.
Numer. Linear Algebra Appl., January, 2024

Parallel Two-Stage Reduction to Hessenberg-Triangular Form.
SIAM J. Sci. Comput., 2024

An Arnoldi-based approach to polynomial and rational least squares problems.
CoRR, 2024

Approximating maps into manifolds with lower curvature bounds.
CoRR, 2024

2023
The seriation problem in the presence of a double Fiedler value.
Numer. Algorithms, January, 2023

Algorithms for Modifying Recurrence Relations of Orthogonal Polynomial and Rational Functions when Changing the Discrete Inner Product.
CoRR, 2023

2022
Generation of orthogonal rational functions by procedures for structured matrices.
Numer. Algorithms, 2022

2021
A Multishift, Multipole Rational QZ Method with Aggressive Early Deflation.
SIAM J. Matrix Anal. Appl., 2021

2020
Swapping 2 × 2 blocks in the Schur and generalized Schur form.
J. Comput. Appl. Math., 2020

2019
A Rational QZ Method.
SIAM J. Matrix Anal. Appl., 2019

When is a matrix unitary or Hermitian plus low rank?
Numer. Linear Algebra Appl., 2019

Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials.
Math. Comput., 2019

Structured backward errors in linearizations.
CoRR, 2019

Pole-swapping algorithms for alternating and palindromic eigenvalue problems.
CoRR, 2019

On pole-swapping algorithms for the eigenvalue problem.
CoRR, 2019

2018
On an Economic Arnoldi Method for BML-Matrices.
SIAM J. Matrix Anal. Appl., 2018

Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil.
SIAM J. Matrix Anal. Appl., 2018

2017
A Framework for Structured Linearizations of Matrix Polynomials in Various Bases.
SIAM J. Matrix Anal. Appl., 2017

2016
The Kähler Mean of Block-Toeplitz Matrices with Toeplitz Structured Blocks.
SIAM J. Matrix Anal. Appl., 2016

Adaptive cross approximation for ill-posed problems.
J. Comput. Appl. Math., 2016

2015
Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking.
SIAM J. Sci. Comput., 2015

Fast and Backward Stable Computation of Roots of Polynomials.
SIAM J. Matrix Anal. Appl., 2015

Short recurrences for computing extended Krylov bases for Hermitian and unitary matrices.
Numerische Mathematik, 2015

2014
Multiple Recurrences and the Associated Matrix Structures Stemming From Normal Matrices.
SIAM J. Numer. Anal., 2014

On Generic Nonexistence of the Schmidt-Eckart-Young Decomposition for Complex Tensors.
SIAM J. Matrix Anal. Appl., 2014

On Deflations in Extended QR Algorithms.
SIAM J. Matrix Anal. Appl., 2014

A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices.
Numer. Algorithms, 2014

Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices.
J. Comput. Appl. Math., 2014

Computing eigenvalues of normal matrices via complex symmetric matrices.
J. Comput. Appl. Math., 2014

Introduction to the special issue.
J. Comput. Appl. Math., 2014

Protein fold recognition using geometric kernel data fusion.
Bioinform., 2014

2013
Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix.
SIAM J. Sci. Comput., 2013

Geometric Mean Algorithms Based on Harmonic and Arithmetic Iterations.
Proceedings of the Geometric Science of Information - First International Conference, 2013

2012
A New Truncation Strategy for the Higher-Order Singular Value Decomposition.
SIAM J. Sci. Comput., 2012

A Generalization of the Multishift QR Algorithm.
SIAM J. Matrix Anal. Appl., 2012

2011
Chasing Bulges or Rotations? A Metamorphosis of the QR-Algorithm.
SIAM J. Matrix Anal. Appl., 2011

A unification of unitary similarity transforms to compressed representations.
Numerische Mathematik, 2011

A unitary similarity transform of a normal matrix to complex symmetric form.
Appl. Math. Lett., 2011

2010
An Implicit Multishift QR-Algorithm for Hermitian Plus Low Rank Matrices.
SIAM J. Sci. Comput., 2010

On the Convergence of Rational Ritz Values.
SIAM J. Matrix Anal. Appl., 2010

Implicit double shift <i>QR</i>-algorithm for companion matrices.
Numerische Mathematik, 2010

A multiple shift QR-step for structured rank matrices.
J. Comput. Appl. Math., 2010

2009
A Quasi-Separable Approach to Solve the Symmetric Definite Tridiagonal Generalized Eigenvalue Problem.
SIAM J. Matrix Anal. Appl., 2009

2008
Rational <i>QR</i>-iteration without inversion.
Numerische Mathematik, 2008

A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix.
Numer. Linear Algebra Appl., 2008

2006
On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form.
Numerische Mathematik, 2006

Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal.
Numerische Mathematik, 2006

A small note on the scaling of symmetric positive definite semiseparable matrices.
Numer. Algorithms, 2006

Inverse eigenvalue probems: Theory, algorithms, and applications.
Math. Comput., 2006

2005
An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form.
SIAM J. Matrix Anal. Appl., 2005

A note on the representation and definition of semiseparable matrices.
Numer. Linear Algebra Appl., 2005

An implicit <i>QR</i> algorithm for symmetric semiseparable matrices.
Numer. Linear Algebra Appl., 2005

A note on the recursive calculation of dominant singular subspaces.
Numer. Algorithms, 2005

2004
A <i>QR</i>-method for computing the singular values via semiseparable matrices.
Numerische Mathematik, 2004


  Loading...