Related papers: Characterizing Real-Valued Multivariate Complex Po…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
Maximal monotone operators on a Banach space into its dual can be represented by convex functions bounded below by the duality product. It is natural to ask under which conditions a convex function represents a maximal monotone operator. A…
We give a criterion which characterizes a real multi-variate Laurent polynomial with full-dimensional smooth Newton polytope to have the property that all sufficiently large powers of the polynomial have fully positive coefficients. Here a…
We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…
Integral properties of multifunctions with closed convex values are studied. In this more general framework not all the tools and the technique used for weakly compact convex valued multifunctions work. We pay particular attention to the…
Can polynomial interpolation be extended to a Banach space setting? Are tensors whose elements are non-commutative Banach space elements legitimate objects with notable analytic and algebraic properties? Here we explore these questions and…
Tree tensor networks such as the tensor train format are a common tool for high dimensional problems. The associated multivariate rank and accordant tuples of singular values are based on different matricizations of the same tensor. While…
We use classical results from harmonic analysis on matrix spaces to investigate the relation between the joint density of the singular values and of the eigenvalues of complex random matrices which are bi-unitarily invariant (also known as…
We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…
We generalize the concept of the symmetric hyperdeterminants for symmetric tensors to the E-determinants for general tensors. We show that the E-determinant inherits many properties of the determinant of a matrix. These properties include:…
The paper is largely concerned with the possibility of obtaining a series representation for a compact linear map $T$ acting between Banach spaces. It is known that, using the notions of $j-$eigenfunctions and $j-$% eigenvalues, such a…
This paper studies sum-of-squares (SOS) representations for structured biquadratic forms. We prove that diagonally dominated symmetric biquadratic tensors are always SOS. For the special case of symmetric biquadratic forms, we establish…
The values at positive integers of the polyzeta functions are solutions of the polynomial equations arising from Drinfeld's associators, which have numerous applications in quantum algebra. Considered as iterated integrals they become…
We generalize the Bernstein-Walsh-Siciak theorem on polynomial approximation in $\mathbb{C}^n$ to the case where the polynomial ring $\mathcal{P}(\mathbb{C}^n)$ is replaced by a subring $\mathcal{P}^S(\mathbb{C}^n)$ consisting of all…
This note deals with a simultaneous approximation of several matrices by a finite family of diagonalizable matrices satisfying an additional condition for the spectrum of a matrix product. That is the simplicity of all eigenvalues.
We study M-tensors and various properties of M-tensors are given. Specially, we show that the smallest real eigenvalue of M-tensor is positive corresponding to a nonnegative eigenvector. We propose an algorithm to find the smallest positive…
In this work, we present a new characterization of symmetric $H^+$-tensors. It is known that a symmetric tensor is an $H^+$-tensor if and only if it is a generalized diagonally dominant tensor with nonnegative diagonal elements. By…
We introduce a new, quadratically convergent algorithm for finding maximum absolute value entries of tensors represented in the canonical format. The computational complexity of the algorithm is linear in the dimension of the tensor. We…
We consider three realization problems about monic real univariate polynomials without vanishing coefficients. Such a polynomial $P:=\sum_{j=0}^db_jx^j$ defines the sign pattern $\sigma (P):=({\rm sgn}(b_d)$, $\ldots$, ${\rm sgn}(b_0))$.…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…