Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
From MaRDI portal
Abstract: In this paper we study multivariate polynomial functions in complex variables and the corresponding associated symmetric tensor representations. The focus is on finding conditions under which such complex polynomials/tensors always take real values. We introduce the notion of symmetric conjugate forms and general conjugate forms, and present characteristic conditions for such complex polynomials to be real-valued. As applications of our results, we discuss the relation between nonnegative polynomials and sums of squares in the context of complex polynomials. Moreover, new notions of eigenvalues/eigenvectors for complex tensors are introduced, extending properties from the Hermitian matrices. Finally, we discuss an important property for symmetric tensors, which states that the largest absolute value of eigenvalue of a symmetric real tensor is equal to its largest singular value; the result is known as Banach's theorem. We show that a similar result holds in the complex case as well.
Recommendations
Cites work
- A Multilinear Singular Value Decomposition
- Alternating direction method of multipliers for real and complex polynomial optimization models
- Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization
- Approximation algorithms for discrete polynomial optimization
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Approximation methods for complex polynomial optimization
- Approximation Methods for Polynomial Optimization
- Complex Quadratic Optimization and Semidefinite Programming
- Eigenvalues and invariants of tensors
- Eigenvalues of a real supersymmetric tensor
- Geometric measure of entanglement and U-eigenvalues of tensors
- scientific article; zbMATH DE number 48992 (Why is no real title available?)
- Maximum block improvement and polynomial optimization
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- On new classes of nonnegative symmetric tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the complexity of purely complex μ computation and related problems in multidimensional systems
- On the convergence of the coordinate descent method for convex differentiable minimization
- On Waring's problem for several algebraic forms
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization
- Semidefinite relaxations for best rank-1 tensor approximations
- Shifted power method for computing tensor eigenpairs
- Symmetric Tensors and Symmetric Tensor Rank
- Tensor principal component analysis via convex optimization
- The best rank-1 approximation of a symmetric tensor and related spherical optimization problems
- The degree of the E-characteristic polynomial of an even order tensor
- The geometric measure of multipartite entanglement and the singular values of a hypermatrix
- The number of eigenvalues of a tensor
- Unconstrained Optimization of Real Functions in Complex Variables
- Über homogene Polynome in ($L^{2}$)
Cited in
(16)- On decompositions and approximations of conjugate partial-symmetric tensors
- Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
- Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors
- Symmetric Hermitian decomposability criterion, decomposition, and its applications
- The E-eigenvectors of tensors
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
- Hermitian tensor decompositions
- The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor
- Further results on tensor nuclear norms
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Positivity of GCD tensors and their determinants
- Polar decomposition-based algorithms on the product of Stiefel manifolds with applications in tensor approximation
- Rank-\(r\) decomposition of symmetric tensors
- Conjugate partial-symmetric tensors
- \(\hat{H}\)-eigenvalues of Hermitian tensors and some applications
This page was built for publication: Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2797107)
