相关论文: On approximate diagonalization of third order symm…

We generalize the property of Jacobi-orthogonality to indefinite scalar product spaces. We compare various principles and investigate relations between Osserman, Jacobi-dual, and Jacobi-orthogonal algebraic curvature tensors. We show that…

Rotational symmetry plays a central role in physics, providing an elegant framework to describe how the properties of 3D objects -- from atoms to the macroscopic scale -- transform under the action of rigid rotations. Equivariant models of…

Grassmann tensors arise from classical problems of scene reconstruction in computer vision. Trifocal Grassmann tensors, related to three projections from a projective space of dimension k onto view-spaces of varying dimensions are studied…

Octupolar tensors are third order, completely symmetric and traceless tensors. Whereas in 2D an octupolar tensor has the same symmetries as an equilateral triangle and can ultimately be identified with a vector in the plane, the symmetries…

In this article, we mainly give the strictly copositive conditions of a special class of third order three dimensional symmetric tensors. More specifically, by means of the polynomial decomposition method, the analytic sufficient and…

We study the orthogonal polynomials associated with the equilibrium measure, in logarithmic potential theory, living on the attractor of an Iterated Function System. We construct sequences of discrete measures, that converge weakly to the…

A symmetric tensor may be regarded as a partially symmetric tensor in several different ways. These produce different notions of rank for the symmetric tensor which are related by chains of inequalities. By exploiting algebraic tools such…

We present a new algorithm for recovering paths from their third-order signature tensors, an inverse problem in rough analysis. Our algorithm provides the exact solution to this learning problem and improves upon current approaches by an…

In this paper we study a generalization of the class of orthogonal polynomials on the real line. These polynomials satisfy the following relation: $(J_5 - \lambda J_3) \vec p(\lambda) = 0$, where $J_3$ is a Jacobi matrix and $J_5$ is a…

There has been continued interest in seeking a theorem describing optimal low-rank approximations to tensors of order 3 or higher, that parallels the Eckart-Young theorem for matrices. In this paper, we argue that the naive approach to this…

We study low T-phase-rank approximation of sectorial third-order tensors $\mathscr{A}\in\mathbb{C}^{n\times n\times p}$ under the tensor T-product. We introduce canonical T-phases and T-phase rank, and formulate the approximation task as…

A general scheme for tridiagonalising differential, difference or q-difference operators using orthogonal polynomials is described. From the tridiagonal form the spectral decomposition can be described in terms of the orthogonality measure…

In this paper, we consider the second-order cone tensor eigenvalue complementarity problem (SOCTEiCP) and present three different reformulations to the model under consideration. Specifically, for the general SOCTEiCP, we first show its…

This paper is concerned with low multilinear rank approximations to antisymmetric tensors, that is, multivariate arrays for which the entries change sign when permuting pairs of indices. We show which ranks can be attained by an…

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

Due to the multi-linearity of tensors, most algorithms for tensor optimization problems are designed based on the block coordinate descent method. Such algorithms are widely employed by practitioners for their implementability and…

In this paper we propose new techniques to sample arbitrary third-order tensors, with an objective of speeding up tensor algorithms that have recently gained popularity in machine learning. Our main contribution is a new way to select, in a…

Eigenvectors of tensors, as studied recently in numerical multilinear algebra, correspond to fixed points of self-maps of a projective space. We determine the number of eigenvectors and eigenvalues of a generic tensor, and we show that the…

The problem of approximate joint diagonalization of a collection of matrices arises in a number of diverse engineering and signal processing problems. This problem is usually cast as an optimization problem, and it is the main goal of this…

Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. The recurrence coefficients determine a tridiagonal semi-infinite matrix (Jacobi matrix) which uniquely characterizes the orthogonal polynomials. We…