Nick Vannieuwenhoven

Numerische Mathematik, August, 2024

A chiseling algorithm for low-rank Grassmann decomposition of skew-symmetric tensors.

[BibT_eX]

[DOI]

CoRR, 2024

Warped geometries of Segre-Veronese manifolds.

[BibT_eX]

[DOI]

CoRR, 2024

Approximating maps into manifolds with lower curvature bounds.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Group-Invariant Tensor Train Networks for Supervised Learning.

[BibT_eX]

[DOI]

Brent Sprangers

SIAM J. Math. Data Sci., December, 2023

The condition number of many tensor decompositions is invariant under Tucker compression.

[BibT_eX]

[DOI]

Numer. Algorithms, October, 2023

Algorithm 1036: ATC, An Advanced Tucker Compression Library for Multidimensional Data.

[BibT_eX]

[DOI]

Wouter Baert

ACM Trans. Math. Softw., June, 2023

The Average Condition Number of Most Tensor Rank Decomposition Problems is Infinite.

[BibT_eX]

[DOI]

Carlos Beltrán

Found. Comput. Math., April, 2023

Hadamard-Hitchcock decompositions: identifiability and computation.

[BibT_eX]

[DOI]

Alessandro Oneto

CoRR, 2023

What part of a numerical problem is ill-conditioned?

[BibT_eX]

[DOI]

CoRR, 2023

2022

A Normal Form Algorithm for Tensor Rank Decomposition.

[BibT_eX]

[DOI]

Simon Telen

ACM Trans. Math. Softw., December, 2022

Sensitivity of low-rank matrix recovery.

[BibT_eX]

[DOI]

Numerische Mathematik, 2022

Tensor completion using geodesics on Segre manifolds.

[BibT_eX]

[DOI]

Lars Swijsen

Joeri Van der Veken

Numer. Linear Algebra Appl., 2022

The condition number of singular subspaces.

[BibT_eX]

[DOI]

CoRR, 2022

2021

The Condition Number of Riemannian Approximation Problems.

[BibT_eX]

[DOI]

SIAM J. Optim., 2021

Three decompositions of symmetric tensors have similar condition numbers.

[BibT_eX]

[DOI]

CoRR, 2021

Relative-error stability of numerical algorithms.

[BibT_eX]

[DOI]

Carlos Beltrán

Vanni Noferini

CoRR, 2021

Algebraic compressed sensing.

[BibT_eX]

[DOI]

CoRR, 2021

ATC: an Advanced Tucker Compression library for multidimensional data.

[BibT_eX]

[DOI]

Wouter Baert

CoRR, 2021

Normal Forms for Tensor Rank Decomposition.

[BibT_eX]

[DOI]

Simon Telen

CoRR, 2021

2019

Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable.

[BibT_eX]

[DOI]

Carlos Beltrán

SIAM J. Matrix Anal. Appl., 2019

A theory of condition for unconstrained perturbations.

[BibT_eX]

[DOI]

CoRR, 2019

Analyzing Soccer Players' Skill Ratings Over Time Using Tensor-Based Methods.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

2018

The Condition Number of Join Decompositions.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2018

A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2018

2017

Effective Criteria for Specific Identifiability of Tensors and Forms.

[BibT_eX]

[DOI]

Luca Chiantini

Giorgio Ottaviani

SIAM J. Matrix Anal. Appl., 2017

2015

Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking.

[BibT_eX]

[DOI]

Karl Meerbergen

Raf Vandebril

SIAM J. Sci. Comput., 2015

2014

On Generic Nonexistence of the Schmidt-Eckart-Young Decomposition for Complex Tensors.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2014

An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors.

[BibT_eX]

[DOI]

Luca Chiantini

Giorgio Ottaviani

SIAM J. Matrix Anal. Appl., 2014

2013

IMF: An Incomplete Multifrontal LU-Factorization for Element-Structured Sparse Linear Systems.

[BibT_eX]

[DOI]

Karl Meerbergen

SIAM J. Sci. Comput., 2013

2012

A New Truncation Strategy for the Higher-Order Singular Value Decomposition.

[BibT_eX]

[DOI]