Publications (19)
A recursive eigenspace computation for the Canonical Polyadic decomposition
Eric Evert, Michiel Vandecappelle, Lieven De Lathauwer
The canonical polyadic decomposition (CPD) is a compact decomposition which expresses a tensor as a sum of its rank-1 components. A common step in the computation of a CPD is compu…
The Arveson boundary of a Free Quadrilateral is given by a noncommutative variety
Eric Evert
Let denote -tuples of real symmetric matrices and set . A free quadrilateral is the collection of…
Efficient evaluation of noncommutative polynomials using tensor and noncommutative Waring decompositions
Eric Evert, J. William Helton, Shiyuan Huang +1
This paper analyses a Waring type decomposition of a noncommuting (NC) polynomial with respect to the goal of evaluating efficiently on tuples of matrices. Such a decomposi…
Convexity of a certain operator trace functional
Eric Evert, Scott McCullough, Tea Å trekelj +1
In this article the operator trace function is introduced and its convexity and concavity properties are investigated.…
Canonical Polyadic Decomposition via the generalized Schur decomposition
Eric Evert, Michiel Vandecappelle, Lieven De Lathauwer
The canonical polyadic decomposition (CPD) is a fundamental tensor decomposition which expresses a tensor as a sum of rank one tensors. In stark contrast to the matrix case, with l…
New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries
Aditya Bhaskara, Eric Evert, Vaidehi Srinivas +1
We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by p…