Seguir
Nick Vannieuwenhoven
Nick Vannieuwenhoven
Assistant Professor at KU Leuven
E-mail confirmado em cs.kuleuven.be - Página inicial
Título
Citado por
Citado por
Ano
A new truncation strategy for the higher-order singular value decomposition
N Vannieuwenhoven, R Vandebril, K Meerbergen
SIAM Journal on Scientific Computing 34 (2), A1027-A1052, 2012
2182012
An algorithm for generic and low-rank specific identifiability of complex tensors
L Chiantini, G Ottaviani, N Vannieuwenhoven
SIAM Journal on Matrix Analysis and Applications 35 (4), 1265-1287, 2014
1082014
On generic identifiability of symmetric tensors of subgeneric rank
L Chiantini, G Ottaviani, N Vannieuwenhoven
Transactions of the American Mathematical Society 369 (6), 4021-4042, 2017
782017
Effective criteria for specific identifiability of tensors and forms
L Chiantini, G Ottaviani, N Vannieuwenhoven
SIAM Journal on Matrix Analysis and Applications 38 (2), 656-681, 2017
582017
The condition number of join decompositions
P Breiding, N Vannieuwenhoven
SIAM Journal on Matrix Analysis and Applications 39 (1), 287-309, 2018
382018
Computing the gradient in optimization algorithms for the CP decomposition in constant memory through tensor blocking
N Vannieuwenhoven, K Meerbergen, R Vandebril
SIAM Journal on Scientific Computing 37 (3), C415-C438, 2015
282015
A Riemannian trust region method for the canonical tensor rank approximation problem
P Breiding, N Vannieuwenhoven
SIAM Journal on Optimization 28 (3), 2435-2465, 2018
262018
Condition numbers for the tensor rank decomposition
N Vannieuwenhoven
Linear Algebra and its Applications 535, 35-86, 2017
252017
Pencil-based algorithms for tensor rank decomposition are not stable
C Beltrán, P Breiding, N Vannieuwenhoven
SIAM Journal on Matrix Analysis and Applications 40 (2), 739-773, 2019
232019
On generic nonexistence of the Schmidt--Eckart--Young decomposition for complex tensors
N Vannieuwenhoven, J Nicaise, R Vandebril, K Meerbergen
SIAM Journal on Matrix Analysis and Applications 35 (3), 886-903, 2014
232014
Identifiability beyond Kruskal's bound for symmetric tensors of degree 4
E Angelini, L Chiantini, N Vannieuwenhoven
Atti Accademia Nazionale dei Lincei. Rendiconti Lincei 29, 465-485, 2017
202017
IMF: An Incomplete Multifrontal -Factorization for Element-Structured Sparse Linear Systems
N Vannieuwenhoven, K Meerbergen
SIAM Journal on Scientific Computing 35 (1), A270-A293, 2013
182013
Most secant varieties of tangential varieties to Veronese varieties are nondefective
H Abo, N Vannieuwenhoven
Transactions of the American Mathematical Society 370 (1), 393-420, 2018
172018
Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
P Breiding, N Vannieuwenhoven
Applied Mathematics Letters 78, 42-50, 2018
162018
The condition number of Riemannian approximation problems
P Breiding, N Vannieuwenhoven
SIAM Journal on Optimization 31 (1), 1049-1077, 2021
112021
On the average condition number of tensor rank decompositions
P Breiding, N Vannieuwenhoven
IMA Journal of Numerical Analysis 40 (3), 1908-1936, 2020
82020
A randomized algorithm for testing nonsingularity of structured matrices with an application to asserting nondefectivity of Segre varieties
N Vannieuwenhoven, R Vandebril, K Meerbergen
IMA Journal of Numerical Analysis 35 (1), 289-324, 2015
72015
Analyzing Soccer Players' Skill Ratings Over Time Using Tensor-Based Methods
K Verstraete, T Decroos, B Coussement, N Vannieuwenhoven, J Davis
Communications in Computer and Information Science 1168, 225-234, 2020
42020
Sensitivity of low-rank matrix recovery
P Breiding, N Vannieuwenhoven
arXiv preprint arXiv:2103.00531, 2021
32021
The average condition number of most tensor rank decomposition problems is infinite
C Beltrán, P Breiding, N Vannieuwenhoven
Foundations of Computational Mathematics, 2022
22022
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20