UB Paderborn / Katalog / Suche / in CDI

Sensitivity of low-rank matrix recovery

Numerische Mathematik, 2022-12, Vol.152 (4), p.725-759

2022

Volltextzugriff (PDF)

Which constraints of a numerical problem cause ill-conditioning?

Numerische Mathematik, 2024-08, Vol.156 (4), p.1427-1453

2024

Volltextzugriff (PDF)

On generic identifiability of symmetric tensors of subgeneric rank

Transactions of the American Mathematical Society, 2017-06, Vol.369 (6), p.4021-4042

2017

Volltextzugriff (PDF)

All secant varieties of the Chow variety are nondefective for cubics and quaternary forms

Transactions of the American Mathematical Society, 2021-07, Vol.374 (7), p.4815-4838

2021

Volltextzugriff (PDF)

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

SIAM journal on matrix analysis and applications, 2014-01, Vol.35 (4), p.1265-1287

2014

Volltextzugriff (PDF)

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

Foundations of computational mathematics, 2023-04, Vol.23 (2), p.433-491

2023

Volltextzugriff (PDF)

Most secant varieties of tangential varieties to Veronese varieties are nondefective

Transactions of the American Mathematical Society, 2018-01, Vol.370 (1), p.393-420

2018

Volltextzugriff (PDF)

Almost all subgeneric third-order Chow decompositions are identifiable

Annali di matematica pura ed applicata, 2022-12, Vol.201 (6), p.2891-2905

2022

Volltextzugriff (PDF)

The condition number of singular subspaces, revisited

Linear algebra and its applications, 2024-04, Vol.687, p.157-180

Vannieuwenhoven, Nick

2024

Volltextzugriff (PDF)

Condition numbers for the tensor rank decomposition

Linear algebra and its applications, 2017-12, Vol.535, p.35-86

Vannieuwenhoven, Nick

2017

Volltextzugriff (PDF)

The Condition Number of Riemannian Approximation Problems

SIAM journal on optimization, 2021-01, Vol.31 (1), p.1049-1077

2021

Volltextzugriff (PDF)

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

SIAM journal on optimization, 2018-01, Vol.28 (3), p.2435-2465

2018

Volltextzugriff (PDF)

Accelerating sparse tensor-times-matrix-chains with all-accumulation

AIP Conference Proceedings, 2024, Vol.3094 (1)

2024

Volltextzugriff (PDF)

The Condition Number of Join Decompositions

SIAM journal on matrix analysis and applications, 2018-01, Vol.39 (1), p.287-309

2018

Volltextzugriff (PDF)

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

ACM transactions on mathematical software, 2023-06, Vol.49 (2), p.1-25, Article 21

2023

Volltextzugriff (PDF)

A Normal Form Algorithm for Tensor Rank Decomposition

ACM transactions on mathematical software, 2022-12, Vol.48 (4), p.1-35, Article 38

2022

Volltextzugriff (PDF)

Condition numbers for the tensor rank decompositio

Linear algebra and its applications, 2017-12, Vol.535, p.35

Vannieuwenhoven, Nick

2017

Volltextzugriff (PDF)

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

SIAM journal on scientific computing, 2012-01, Vol.34 (2), p.A1027-A1052

2012

Volltextzugriff (PDF)

Effective Criteria for Specific Identifiability of Tensors and Forms

SIAM journal on matrix analysis and applications, 2017-01, Vol.38 (2), p.656-681

2017

Volltextzugriff (PDF)

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

Applied mathematics letters, 2018-04, Vol.78, p.42-50

2018

Volltextzugriff (PDF)

On the average condition number of tensor rank decompositions

IMA journal of numerical analysis, 2020-07, Vol.40 (3), p.1908-1936

2020

Volltextzugriff (PDF)

Three decompositions of symmetric tensors have similar condition numbers

Linear algebra and its applications, 2023-05, Vol.664, p.253-263

2023

Volltextzugriff (PDF)

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

Numerical algorithms, 2023-10, Vol.94 (2), p.1003-1029

2023

Volltextzugriff (PDF)

Algebraic compressed sensing

Applied and computational harmonic analysis, 2023-07, Vol.65, p.374-406

2023

Volltextzugriff (PDF)

When can forward stable algorithms be composed stably?

IMA journal of numerical analysis, 2024-04, Vol.44 (2), p.886-919

2024

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Sensitivity of low-rank matrix recovery

Which constraints of a numerical problem cause ill-conditioning?

On generic identifiability of symmetric tensors of subgeneric rank

All secant varieties of the Chow variety are nondefective for cubics and quaternary forms

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

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

Most secant varieties of tangential varieties to Veronese varieties are nondefective

Almost all subgeneric third-order Chow decompositions are identifiable

The condition number of singular subspaces, revisited

Condition numbers for the tensor rank decomposition

The Condition Number of Riemannian Approximation Problems

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

Accelerating sparse tensor-times-matrix-chains with all-accumulation

The Condition Number of Join Decompositions

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

A Normal Form Algorithm for Tensor Rank Decomposition

Condition numbers for the tensor rank decompositio

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

Effective Criteria for Specific Identifiability of Tensors and Forms

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

On the average condition number of tensor rank decompositions

Three decompositions of symmetric tensors have similar condition numbers

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

Algebraic compressed sensing

When can forward stable algorithms be composed stably?

Suchergebnisse filtern