相关论文: Subspace method for multiparameter-eigenvalue prob…

This paper lies in the intersection of several fields: number theory, lattice theory, multilinear algebra, and scientific computing. We adapt existing solution algorithms for tensor eigenvalue problems to the tensor-train framework. As an…

Such problems as computation of spectra of spin chains and vibrational spectra of molecules can be written as high-dimensional eigenvalue problems, i.e., when the eigenvector can be naturally represented as a multidimensional tensor. Tensor…

In this paper, we propose a type of tensor-neural-network-based machine learning method to compute multi-eigenpairs of high dimensional eigenvalue problems without Monte-Carlo procedure. Solving multi-eigenvalues and their corresponding…

We consider an approximate computation of several minimal eigenpairs of large Hermitian matrices which come from high--dimensional problems. We use the tensor train format (TT) for vectors and matrices to overcome the curse of…

A tensor $\mathcal T\in \mathbb T(\mathbb C^n,m+1)$, the space of tensors of order $m+1$ and dimension $n$ with complex entries, has $nm^{n-1}$ eigenvalues (counted with algebraic multiplicities). The inverse eigenvalue problem for tensors…

M-eigenvalues of fourth order hierarchically symmetric tensors play a significant role in nonlinear elastic material analysis and quantum entanglement problems. This paper focuses on computing extreme M-eigenvalues for such tensors. To…

We propose a new method for low-rank approximation of Moore-Penrose pseudoinverses (MPPs) of large-scale matrices using tensor networks. The computed pseudoinverses can be useful for solving or preconditioning of large-scale overdetermined…

We propose a multilevel tensor-train (TT) framework for solving nonlinear partial differential equations (PDEs) in a global space-time formulation. While space-time TT solvers have demonstrated significant potential for compressed…

Standard multiparameter eigenvalue problems (MEPs) are systems of $k\ge 2$ linear $k$-parameter square matrix pencils. Recently, a new form of multiparameter eigenvalue problems has emerged: a rectangular MEP (RMEP) with only one…

Tensor network techniques, known for their low-rank approximation ability that breaks the curse of dimensionality, are emerging as a foundation of new mathematical methods for ultra-fast numerical solutions of high-dimensional Partial…

We propose subspace methods for 3-parameter eigenvalue problems. Such problems arise when separation of variables is applied to separable boundary value problems; a particular example is the Helmholtz equation in ellipsoidal and…

We introduce the concept of mode-k generalized eigenvalues and eigenvectors of a tensor and prove some properties of such eigenpairs. In particular, we derive an upper bound for the number of equivalence classes of generalized tensor…

The aim of this paper is to introduce a FieldTNN-based machine learning method for solving the Maxwell eigenvalue problem in both 2D and 3D domains, including both tensor and non-tensor computational regions. First, we extend the existing…

In this paper, we propose a method for computing eigenvalues of elliptic problems using Deep Learning techniques. A key feature of our approach is that it is independent of the space dimension and can compute arbitrary eigenvalues without…

The rectangular multiparameter eigenvalue problem (RMEP) involves rectangular coefficient matrices (usually with more rows than columns) and may potentially have no solution in its original form. A minimal perturbation framework is proposed…

We present a novel, global algorithm for solving polynomial multiparameter eigenvalue problems (PMEPs) by leveraging a hidden variable tensor Dixon resultant framework. Our method transforms a PMEP into one or more univariate polynomial…

Homogenization in terms of multiscale limits transforms a multiscale problem with $n+1$ asymptotically separated microscales posed on a physical domain $D \subset \mathbb{R}^d$ into a one-scale problem posed on a product domain of dimension…

The aim of this paper is to present a mathematical framework for tensor PCA. The proposed approach is able to overcome the limitations of previous methods that extract a low dimensional subspace by iteratively solving an optimization…

The Tensor-Train (TT) format is a highly compact low-rank representation for high-dimensional tensors. TT is particularly useful when representing approximations to the solutions of certain types of parametrized partial differential…

In this work, we introduce an interior-point method that employs tensor decompositions to efficiently represent and manipulate the variables and constraints of semidefinite programs, targeting problems where the solutions may not be…