Nick Vannieuwenhoven

From MaRDI portal
Person:1650837

Available identifiers

zbMath Open vannieuwenhoven.nickMaRDI QIDQ1650837

List of research outcomes





PublicationDate of PublicationType
When can forward stable algorithms be composed stably?2024-10-30Paper
Algorithm 1036: ATC, an advanced Tucker compression library for multidimensional data2024-09-10Paper
A normal form algorithm for tensor rank decomposition2024-09-06Paper
Which constraints of a numerical problem cause ill-conditioning?2024-08-13Paper
The condition number of singular subspaces, revisited2024-02-28Paper
Group-Invariant Tensor Train Networks for Supervised Learning2023-11-20Paper
The condition number of many tensor decompositions is invariant under Tucker compression2023-09-12Paper
Hadamard-Hitchcock decompositions: identifiability and computation2023-08-12Paper
What part of a numerical problem is ill-conditioned?2023-05-19Paper
Algebraic compressed sensing2023-05-03Paper
The average condition number of most tensor rank decomposition problems is infinite2023-04-12Paper
Three decompositions of symmetric tensors have similar condition numbers2023-03-09Paper
Tensor completion using geodesics on Segre manifolds2023-02-21Paper
Sensitivity of low-rank matrix recovery2022-11-22Paper
Almost all subgeneric third-order Chow decompositions are identifiable2022-10-21Paper
The parametrized superelement approach for lattice joint modelling and simulation2022-09-09Paper
Three decompositions of symmetric tensors have similar condition numbers2021-10-08Paper
When can forward stable algorithms be composed stably?2021-09-22Paper
All secant varieties of the Chow variety are nondefective for cubics and quaternary forms2021-06-08Paper
The Condition Number of Riemannian Approximation Problems2021-03-31Paper
On the average condition number of tensor rank decompositions2021-03-31Paper
A Normal Form Algorithm for Tensor Rank Decomposition2021-03-12Paper
Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable2019-08-29Paper
The average condition number of most tensor rank decomposition problems is infinite2019-03-13Paper
A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem2018-09-18Paper
Identifiability beyond Kruskal's bound for symmetric tensors of degree 42018-07-13Paper
The Condition Number of Join Decompositions2018-03-02Paper
Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number2018-01-31Paper
Most secant varieties of tangential varieties to Veronese varieties are nondefective2017-11-01Paper
Condition numbers for the tensor rank decomposition2017-10-10Paper
Effective Criteria for Specific Identifiability of Tensors and Forms2017-08-14Paper
On generic identifiability of symmetric tensors of subgeneric rank2017-03-31Paper
Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking2015-06-23Paper
An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors2015-04-21Paper
A randomized algorithm for testing nonsingularity of structured matrices with an application to asserting nondefectivity of Segre varieties2015-02-17Paper
On Generic Nonexistence of the Schmidt--Eckart--Young Decomposition for Complex Tensors2014-12-17Paper
IMF: An Incomplete Multifrontal $LU$-Factorization for Element-Structured Sparse Linear Systems2013-04-29Paper
A new truncation strategy for the higher-order singular value decomposition2012-08-23Paper
Approximating maps into manifolds with lower curvature boundsN/APaper

Research outcomes over time

This page was built for person: Nick Vannieuwenhoven