相关论文: Minimal Gersgorin tensor eigenvalue inclusion set …
An M-eigenvalue of a nonnegative biquadratic tensor is referred to as an M$^+$-eigenvalue if it has a pair of nonnegative M-eigenvectors. If furthermore that pair of M-eigenvectors is positive, then that M$^+$-eigenvalue is called an…
A method for computing lower bounds to eigenvalues of sums of lower semibounded self-adjoint operators is presented. We apply the method to one-electron Hamiltonians. To improve the lower bounds we consider symmetry of molecules and use…
We present reliable a-posteriori error estimates for $hp$-adaptive finite element approximations of eigenvalue/eigenvector problems. Starting from our earlier work on $h$ adaptive finite element approximations we show a way to obtain…
Suppose a finite group acts on a scheme X and a finite-dimensional Lie algebra g. The corresponding equivariant map algebra is the Lie algebra M of equivariant regular maps from X to g. We classify the irreducible finite-dimensional…
In this paper, we focus on developing randomized algorithms for the computation of low multilinear rank approximations of tensors based on the random projection and the singular value decomposition. Following the theory of the singular…
A concrete formulation of the Lehmann-Maehly-Goerisch method for semi-definite self-adjoint operators with compact resolvent is considered. Precise rates of convergence are determined in terms of how well the trial spaces capture the…
We study the decomposability and the subdifferential of the tensor nuclear norm. Both concepts are well understood and widely applied in matrices but remain unclear for higher-order tensors. We show that the tensor nuclear norm admits a…
We consider a framework for the construction of iterative schemes for operator equations that combine low-rank approximation in tensor formats and adaptive approximation in a basis. Under fairly general assumptions, we obtain a rigorous…
Conjugation covariants of matrices are applied to study the real algebraic variety consisting of complex Hermitian matrices with a bounded number of distinct eigenvalues. A minimal generating system of the vanishing ideal of degenerate…
We study the decision version of tensor spectral norm from the viewpoint of real algebraic complexity. For a rationally specified tensor, the tensor spectral threshold problem asks whether its spectral norm exceeds a prescribed rational…
We propose and discuss a new computational method for the numerical approximation of reachable sets for nonlinear control systems. It is based on the support vector machine algorithm and represents the set approximation as a sublevel set of…
The approximation of tensors is important for the efficient numerical treatment of high dimensional problems, but it remains an extremely challenging task. One of the most popular approach to tensor approximation is the alternating least…
The purpose of this paper is to study the problem of computing unitary eigenvalues (U-eigenvalues) of non-symmetric complex tensors. By means of symmetric embedding of complex tensors, the relationship between U-eigenpairs of a…
A tensor is a multi-way array that can represent, in addition to a data set, the expression of a joint law or a multivariate function. As such it contains the description of the interactions between the variables corresponding to each of…
In this paper, it is proved that (strict) copositivity of a symmetric tensor $\mathcal{A}$ is equivalent to the fact that every principal sub-tensor of $\mathcal{A}$ has no a (non-positive) negative $H^{++}$-eigenvalue. The necessary and…
It is shown that the Gel'fand-Tsetlin realization of irreducible representations of the $A_n$ algebra is directly connected with a linear exactly integrable system in the n-dimensional space. General solution for this system is explicitly…
The tensor rank decomposition problem consists of recovering the unique set of parameters representing a robustly identifiable low-rank tensor when the coordinate representation of the tensor is presented as input. A condition number for…
We consider a version of geometric programming problem consisting in minimizing a function given by the maximum of finitely many log-Laplace transforms of discrete nonnegative measures on a Euclidean space. Under a coerciveness assumption,…
This paper is concerned with the computable error estimates for the eigenvalue problem which is solved by the general conforming finite element methods on the general meshes. Based on the computable error estimate, we can give an…
We obtain sequences of inclusion sets for the spectrum, essential spectrum, and pseudospectrum of banded, in general non-normal, matrices of finite or infinite size. Each inclusion set is the union of the pseudospectra of certain…