Computation of extremal eigenvalues of high-dimensional lattice-theoretic tensors via tensor-train decompositions
Harri Hakula, Pauliina Ilmonen, Vesa Kaarnioja

TL;DR
This paper develops tensor-train algorithms to compute extremal eigenvalues of high-dimensional lattice-theoretic tensors, overcoming the curse of dimensionality and enabling tractable analysis of complex tensor eigenvalue problems.
Contribution
It introduces explicit low-rank tensor-train decompositions for meet and LCM tensors, making high-dimensional eigenvalue computations feasible and independent of tensor order.
Findings
Tensor-train decomposition effectively reduces complexity
Eigenvalue algorithms are adapted for tensor-train format
Numerical examples demonstrate method effectiveness
Abstract
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 application, we consider eigenvalue problems associated with a class of lattice-theoretic meet and join tensors, which may be regarded as multidimensional extensions of the classically studied meet and join matrices such as GCD and LCM matrices, respectively. In order to effectively apply the solution algorithms, we show that meet tensors have an explicit low-rank tensor-train decomposition with sparse tensor-train cores with respect to the dimension. Moreover, this representation is independent of tensor order, which eliminates the so-called curse of dimensionality from the numerical analysis of these objects and makes the solution of tensor…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Matrix Theory and Algorithms · Parallel Computing and Optimization Techniques
