default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNick Vannieuwenhoven
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Nick Dewaele, Nick Vannieuwenhoven:
Which constraints of a numerical problem cause ill-conditioning? Numerische Mathematik 156(4): 1427-1453 (2024)- [i16]Simon Jacobsson, Raf Vandebril, Joeri Van der Veken, Nick Vannieuwenhoven:
Approximating maps into manifolds with lower curvature bounds. CoRR abs/2403.16785 (2024) - [i15]Simon Jacobsson, Lars Swijsen, Joeri Van der Veken, Nick Vannieuwenhoven:
Warped geometries of Segre-Veronese manifolds. CoRR abs/2410.00664 (2024) - [i14]Nick Vannieuwenhoven:
A chiseling algorithm for low-rank Grassmann decomposition of skew-symmetric tensors. CoRR abs/2410.14486 (2024) - 2023
- [j18]Carlos Beltrán
, Paul Breiding, Nick Vannieuwenhoven:
The Average Condition Number of Most Tensor Rank Decomposition Problems is Infinite. Found. Comput. Math. 23(2): 433-491 (2023) - [j17]Nick Dewaele, Paul Breiding, Nick Vannieuwenhoven:
The condition number of many tensor decompositions is invariant under Tucker compression. Numer. Algorithms 94(2): 1003-1029 (2023) - [j16]Brent Sprangers, Nick Vannieuwenhoven:
Group-Invariant Tensor Train Networks for Supervised Learning. SIAM J. Math. Data Sci. 5(4): 829-853 (2023) - [j15]Wouter Baert, Nick Vannieuwenhoven:
Algorithm 1036: ATC, An Advanced Tucker Compression Library for Multidimensional Data. ACM Trans. Math. Softw. 49(2): 21:1-21:25 (2023) - [i13]Nick Dewaele, Nick Vannieuwenhoven:
What part of a numerical problem is ill-conditioned? CoRR abs/2305.11547 (2023) - [i12]Alessandro Oneto, Nick Vannieuwenhoven:
Hadamard-Hitchcock decompositions: identifiability and computation. CoRR abs/2308.06597 (2023) - 2022
- [j14]Lars Swijsen, Joeri Van der Veken, Nick Vannieuwenhoven:
Tensor completion using geodesics on Segre manifolds. Numer. Linear Algebra Appl. 29(6) (2022) - [j13]Paul Breiding, Nick Vannieuwenhoven:
Sensitivity of low-rank matrix recovery. Numerische Mathematik 152(4): 725-759 (2022) - [j12]Simon Telen, Nick Vannieuwenhoven:
A Normal Form Algorithm for Tensor Rank Decomposition. ACM Trans. Math. Softw. 48(4): 38:1-38:35 (2022) - [i11]Brent Sprangers, Nick Vannieuwenhoven:
Group-invariant tensor train networks for supervised learning. CoRR abs/2206.15051 (2022) - [i10]Nick Vannieuwenhoven:
The condition number of singular subspaces. CoRR abs/2208.08368 (2022) - 2021
- [j11]Paul Breiding, Nick Vannieuwenhoven:
The Condition Number of Riemannian Approximation Problems. SIAM J. Optim. 31(1): 1049-1077 (2021) - [i9]Paul Breiding, Nick Vannieuwenhoven:
Sensitivity of low-rank matrix recovery. CoRR abs/2103.00531 (2021) - [i8]Simon Telen, Nick Vannieuwenhoven:
Normal Forms for Tensor Rank Decomposition. CoRR abs/2103.07411 (2021) - [i7]Nick Dewaele, Paul Breiding, Nick Vannieuwenhoven:
The condition number of many tensor decompositions is invariant under Tucker compression. CoRR abs/2106.13034 (2021) - [i6]Wouter Baert, Nick Vannieuwenhoven:
ATC: an Advanced Tucker Compression library for multidimensional data. CoRR abs/2107.01384 (2021) - [i5]Lars Swijsen, Joeri Van der Veken, Nick Vannieuwenhoven:
Tensor completion using geodesics on Segre manifolds. CoRR abs/2108.00735 (2021) - [i4]Paul Breiding, Fulvio Gesmundo, Mateusz Michalek, Nick Vannieuwenhoven:
Algebraic compressed sensing. CoRR abs/2108.13208 (2021) - [i3]Carlos Beltrán, Vanni Noferini, Nick Vannieuwenhoven:
Relative-error stability of numerical algorithms. CoRR abs/2109.10610 (2021) - [i2]Nick Dewaele, Paul Breiding, Nick Vannieuwenhoven:
Three decompositions of symmetric tensors have similar condition numbers. CoRR abs/2110.04172 (2021)
2010 – 2019
- 2019
- [j10]Carlos Beltrán, Paul Breiding, Nick Vannieuwenhoven:
Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable. SIAM J. Matrix Anal. Appl. 40(2): 739-773 (2019) - [c1]Kenneth Verstraete, Tom Decroos, Bruno Coussement, Nick Vannieuwenhoven, Jesse Davis:
Analyzing Soccer Players' Skill Ratings Over Time Using Tensor-Based Methods. PKDD/ECML Workshops (2) 2019: 225-234 - [i1]Paul Breiding, Nick Vannieuwenhoven:
A theory of condition for unconstrained perturbations. CoRR abs/1909.12186 (2019) - 2018
- [j9]Paul Breiding, Nick Vannieuwenhoven:
Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number. Appl. Math. Lett. 78: 42-50 (2018) - [j8]Paul Breiding, Nick Vannieuwenhoven:
A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem. SIAM J. Optim. 28(3): 2435-2465 (2018) - [j7]Paul Breiding, Nick Vannieuwenhoven:
The Condition Number of Join Decompositions. SIAM J. Matrix Anal. Appl. 39(1): 287-309 (2018) - 2017
- [j6]Luca Chiantini, Giorgio Ottaviani, Nick Vannieuwenhoven:
Effective Criteria for Specific Identifiability of Tensors and Forms. SIAM J. Matrix Anal. Appl. 38(2): 656-681 (2017) - 2015
- [j5]Nick Vannieuwenhoven, Karl Meerbergen, Raf Vandebril:
Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking. SIAM J. Sci. Comput. 37(3) (2015) - 2014
- [j4]Nick Vannieuwenhoven, Johannes Nicaise, Raf Vandebril, Karl Meerbergen:
On Generic Nonexistence of the Schmidt-Eckart-Young Decomposition for Complex Tensors. SIAM J. Matrix Anal. Appl. 35(3): 886-903 (2014) - [j3]Luca Chiantini, Giorgio Ottaviani, Nick Vannieuwenhoven:
An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors. SIAM J. Matrix Anal. Appl. 35(4): 1265-1287 (2014) - 2013
- [j2]Nick Vannieuwenhoven, Karl Meerbergen:
IMF: An Incomplete Multifrontal LU-Factorization for Element-Structured Sparse Linear Systems. SIAM J. Sci. Comput. 35(1) (2013) - 2012
- [j1]Nick Vannieuwenhoven, Raf Vandebril, Karl Meerbergen:
A New Truncation Strategy for the Higher-Order Singular Value Decomposition. SIAM J. Sci. Comput. 34(2) (2012)
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 2025-01-21 00:20 CET 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:
