Related papers: Matrix regularization for tensor fields
A consistent, local coordinate formulation of covariant Hamiltonian field theory is presented. Whereas the covariant canonical field equations are equivalent to the Euler-Lagrange field equations, the covariant canonical transformation…
The graph matching problem is a significant special case of the Quadratic Assignment Problem, with extensive applications in pattern recognition, computer vision, protein alignments and related fields. As the problem is NP-hard, relaxation…
The main aim of this paper is to develop a framelet representation of the tensor nuclear norm for third-order tensor completion. In the literature, the tensor nuclear norm can be computed by using tensor singular value decomposition based…
The problem of finding a canonical form of complex matrices up to conjugacy with the set of canonical matrices being a union of affine planes in the matrix space is considered. A solution of the problem is given producing a new canonical…
We give a new proof for an equality of certain max-min and min-max approximation problems involving normal matrices. The previously published proofs of this equality apply tools from matrix theory, (analytic) optimization theory and…
We examine the concept of field in tensor-triangular geometry. We gather examples and discuss possible approaches, while highlighting open problems. As the construction of residue tt-fields remains elusive, we instead produce suitable…
We study the distribution of singular and unimodular matrices in sumsets in matrix rings over finite fields. We apply these results to estimate the largest prime divisor of the determinants in sumsets in matrix rings over the integers.
In this paper we present a general convex optimization approach for solving high-dimensional multiple response tensor regression problems under low-dimensional structural assumptions. We consider using convex and weakly decomposable…
Tensor completion refers to the task of estimating the missing data from an incomplete measurement or observation, which is a core problem frequently arising from the areas of big data analysis, computer vision, and network engineering. Due…
Low-rank tensor completion problem aims to recover a tensor from limited observations, which has many real-world applications. Due to the easy optimization, the convex overlapping nuclear norm has been popularly used for tensor completion.…
We consider the tensors generating matrix product states and density operators in a spin chain. For pure states, we revise the renormalization procedure introduced by F. Verstraete et al. in 2005 and characterize the tensors corresponding…
We are concerned with the eigenstructure of supersymmetric tensors. Like in the matrix case, normalized tensor eigenvectors are fixed points of the tensor power iteration map. However, unless the given tensor is orthogonally decomposable,…
This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with…
We propose a real-space renormalization group algorithm for accurately coarse-graining two-dimensional tensor networks. The central innovation of our method lies in utilizing variational boundary tensors as a globally optimized environment…
In this work, we consider ill-posed inverse problems in which the forward operator is continuous and weakly closed, and the sought solution belongs to a weakly closed constraint set. We propose a regularization method based on minimizing…
We describe the recursive algorithmic procedure to compute the stabilizers of the group of complex orthogonal matrices with respect to the action of similarity on the set of all symmetric matrices. Futhermore, lower bounds for dimensions of…
We propose a novel regularization scheme in quantum field theory, denominator regularization (den reg). As simple to apply as dimensional regularization, and similarly compatible with a minimal subtraction renormalization scheme, den reg…
In this paper we consider several problems of joint similarity to tuples of bounded linear operators in noncommutative polydomains and varieties associated with sets of noncommutative polynomials. We obtain analogues of classical results…
This paper investigates a novel connection between reductions of companion matrices associated with a symmetric family of certain binomial ideals in the coordinate ring of affine n-space and permutation matrices. Specifically, for fixed…
We classify tensors with maximal and next to maximal dimensional symmetry groups under a natural genericity assumption (1-genericity), in dimensions greater than 7. In other words, we classify minimal dimensional orbits in the space of…