default search action
Raf Vandebril
Person information
- affiliation: Catholic University of Leuven, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j48]Nicola Mastronardi, Marc Van Barel
, Raf Vandebril
Rational QZ steps with perfect shifts. Numer. Algorithms 95(3): 1079-1102 (2024) - [j47]Thijs Steel
A new deflation criterion for the QZ algorithm. Numer. Linear Algebra Appl. 31(1) (2024) - [j46]Thijs Steel, Raf Vandebril
Parallel Two-Stage Reduction to Hessenberg-Triangular Form. SIAM J. Sci. Comput. 46(2): 56- (2024) - [i10]Simon Jacobsson, Raf Vandebril, Joeri Van der Veken, Nick Vannieuwenhoven:
Approximating maps into manifolds with lower curvature bounds. CoRR abs/2403.16785 (2024) - [i9]Amin Faghih, Marc Van Barel, Niel Van Buggenhout, Raf Vandebril:
An Arnoldi-based approach to polynomial and rational least squares problems. CoRR abs/2407.05945 (2024) - 2023
- [j45]Anna Concas, Caterina Fenu
The seriation problem in the presence of a double Fiedler value. Numer. Algorithms 92(1): 407-435 (2023) - [i8]Thijs Steel, Raf Vandebril:
Parallel two-stage reduction to Hessenberg-triangular form. CoRR abs/2301.07964 (2023) - [i7]Marc Van Barel
Algorithms for Modifying Recurrence Relations of Orthogonal Polynomial and Rational Functions when Changing the Discrete Inner Product. CoRR abs/2302.00355 (2023) - 2022
- [j44]Niel Van Buggenhout
Generation of orthogonal rational functions by procedures for structured matrices. Numer. Algorithms 89(2): 551-582 (2022) - [i6]Anna Concas, Caterina Fenu, Giuseppe Rodriguez, Raf Vandebril:
The seriation problem in the presence of a double Fiedler value. CoRR abs/2204.03362 (2022) - [i5]Thijs Steel, Raf Vandebril
A new deflation criterion for the QZ algorithm. CoRR abs/2208.02057 (2022) - 2021
- [j43]Thijs Steel
A Multishift, Multipole Rational QZ Method with Aggressive Early Deflation. SIAM J. Matrix Anal. Appl. 42(2): 753-774 (2021) - [i4]Niel Van Buggenhout, Marc Van Barel, Raf Vandebril:
Generation of orthogonal rational functions by procedures for structured matrices. CoRR abs/2103.04788 (2021) - 2020
- [j42]Daan Camps
Swapping 2 × 2 blocks in the Schur and generalized Schur form. J. Comput. Appl. Math. 373: 112274 (2020)
2010 – 2019
- 2019
- [j41]Jared Lee Aurentz
Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials. Math. Comput. 88(315): 313-347 (2019) - [j40]Gianna M. Del Corso
When is a matrix unitary or Hermitian plus low rank? Numer. Linear Algebra Appl. 26(6) (2019) - [j39]Daan Camps
A Rational QZ Method. SIAM J. Matrix Anal. Appl. 40(3): 943-972 (2019) - [i3]Daan Camps, Thomas Mach, Raf Vandebril, David S. Watkins:
On pole-swapping algorithms for the eigenvalue problem. CoRR abs/1906.08672 (2019) - [i2]Thomas Mach, Raf Vandebril, David S. Watkins:
Pole-swapping algorithms for alternating and palindromic eigenvalue problems. CoRR abs/1906.09942 (2019) - [i1]Vanni Noferini, Leonardo Robol, Raf Vandebril:
Structured backward errors in linearizations. CoRR abs/1912.04157 (2019) - 2018
- [j38]Bernhard Beckermann, Clara Mertens, Raf Vandebril
On an Economic Arnoldi Method for BML-Matrices. SIAM J. Matrix Anal. Appl. 39(2): 737-768 (2018) - [j37]Jared Lee Aurentz
Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil. SIAM J. Matrix Anal. Appl. 39(3): 1245-1269 (2018) - 2017
- [j36]Leonardo Robol
A Framework for Structured Linearizations of Matrix Polynomials in Various Bases. SIAM J. Matrix Anal. Appl. 38(1): 188-216 (2017) - 2016
- [j35]Thomas Mach
Adaptive cross approximation for ill-posed problems. J. Comput. Appl. Math. 303: 206-217 (2016) - [j34]Ben Jeuris, Raf Vandebril
The Kähler Mean of Block-Toeplitz Matrices with Toeplitz Structured Blocks. SIAM J. Matrix Anal. Appl. 37(3): 1151-1175 (2016) - 2015
- [j33]Clara Mertens, Raf Vandebril
Short recurrences for computing extended Krylov bases for Hermitian and unitary matrices. Numerische Mathematik 131(2): 303-328 (2015) - [j32]Jared Lee Aurentz
Fast and Backward Stable Computation of Roots of Polynomials. SIAM J. Matrix Anal. Appl. 36(3): 942-973 (2015) - [j31]Nick Vannieuwenhoven
Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking. SIAM J. Sci. Comput. 37(3) (2015) - 2014
- [j30]Pooya Zakeri, Ben Jeuris, Raf Vandebril
Protein fold recognition using geometric kernel data fusion. Bioinform. 30(13): 1850-1857 (2014) - [j29]Micol Ferranti, Raf Vandebril
Computing eigenvalues of normal matrices via complex symmetric matrices. J. Comput. Appl. Math. 259: 281-293 (2014) - [j28]Dario A. Bini, Lieven De Lathauwer, Nicola Mastronardi
Introduction to the special issue. J. Comput. Appl. Math. 272: 275 (2014) - [j27]Thomas Mach
Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices. J. Comput. Appl. Math. 272: 377-398 (2014) - [j26]Micol Ferranti, Thanh Hieu Le
A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices. Numer. Algorithms 67(1): 109-120 (2014) - [j25]Thomas Mach
On Deflations in Extended QR Algorithms. SIAM J. Matrix Anal. Appl. 35(2): 559-579 (2014) - [j24]Nick Vannieuwenhoven
On Generic Nonexistence of the Schmidt-Eckart-Young Decomposition for Complex Tensors. SIAM J. Matrix Anal. Appl. 35(3): 886-903 (2014) - [j23]Clara Mertens, Raf Vandebril
Multiple Recurrences and the Associated Matrix Structures Stemming From Normal Matrices. SIAM J. Numer. Anal. 52(6): 2977-2999 (2014) - 2013
- [j22]Jared Lee Aurentz
Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix. SIAM J. Sci. Comput. 35(1) (2013) - [c1]Ben Jeuris, Raf Vandebril
Geometric Mean Algorithms Based on Harmonic and Arithmetic Iterations. GSI 2013: 785-793 - 2012
- [j21]Raf Vandebril
A Generalization of the Multishift QR Algorithm. SIAM J. Matrix Anal. Appl. 33(3): 759-779 (2012) - [j20]Nick Vannieuwenhoven
A New Truncation Strategy for the Higher-Order Singular Value Decomposition. SIAM J. Sci. Comput. 34(2) (2012) - 2011
- [j19]Raf Vandebril
A unitary similarity transform of a normal matrix to complex symmetric form. Appl. Math. Lett. 24(2): 160-164 (2011) - [j18]Raf Vandebril
A unification of unitary similarity transforms to compressed representations. Numerische Mathematik 119(4): 641-665 (2011) - [j17]Raf Vandebril
Chasing Bulges or Rotations? A Metamorphosis of the QR-Algorithm. SIAM J. Matrix Anal. Appl. 32(1): 217-247 (2011) - 2010
- [j16]Raf Vandebril
A multiple shift QR-step for structured rank matrices. J. Comput. Appl. Math. 233(5): 1326-1344 (2010) - [j15]Marc Van Barel
Implicit double shift QR-algorithm for companion matrices. Numerische Mathematik 116(2): 177-212 (2010) - [j14]Bernhard Beckermann, Stefan Güttel
On the Convergence of Rational Ritz Values. SIAM J. Matrix Anal. Appl. 31(4): 1740-1774 (2010) - [j13]Raf Vandebril
An Implicit Multishift QR-Algorithm for Hermitian Plus Low Rank Matrices. SIAM J. Sci. Comput. 32(4): 2190-2212 (2010)
2000 – 2009
- 2009
- [j12]Raf Vandebril
A Quasi-Separable Approach to Solve the Symmetric Definite Tridiagonal Generalized Eigenvalue Problem. SIAM J. Matrix Anal. Appl. 31(1): 154-174 (2009) - 2008
- [j11]Nicola Mastronardi
A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix. Numer. Linear Algebra Appl. 15(4): 327-337 (2008) - [j10]Raf Vandebril
Rational QR-iteration without inversion. Numerische Mathematik 110(4): 561-575 (2008) - 2006
- [j9]Raf Vandebril:
Inverse eigenvalue probems: Theory, algorithms, and applications. Math. Comput. 75(254) (2006) - [j8]Raf Vandebril
A small note on the scaling of symmetric positive definite semiseparable matrices. Numer. Algorithms 41(3): 319-326 (2006) - [j7]Raf Vandebril
Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal. Numerische Mathematik 102(4): 709-726 (2006) - [j6]Raf Vandebril
On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form. Numerische Mathematik 104(2): 205-239 (2006) - 2005
- [j5]Nicola Mastronardi
A note on the recursive calculation of dominant singular subspaces. Numer. Algorithms 38(4): 237-242 (2005) - [j4]Raf Vandebril
An implicit QR algorithm for symmetric semiseparable matrices. Numer. Linear Algebra Appl. 12(7): 625-658 (2005) - [j3]Raf Vandebril
A note on the representation and definition of semiseparable matrices. Numer. Linear Algebra Appl. 12(8): 839-858 (2005) - [j2]Marc Van Barel
An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form. SIAM J. Matrix Anal. Appl. 27(1): 176-197 (2005) - 2004
- [j1]Raf Vandebril
A QR-method for computing the singular values via semiseparable matrices. Numerische Mathematik 99(1): 163-195 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: