Related papers: New Algorithm for Tensor Calculation in Field Theo…
Higher-order tensor methods were recently proposed for minimizing smooth convex and nonconvex functions. Higher-order algorithms accelerate the convergence of the classical first-order methods thanks to the higher-order derivatives used in…
We present a stochastic optimization method that uses a fourth-order regularized model to find local minima of smooth and potentially non-convex objective functions with a finite-sum structure. This algorithm uses sub-sampled derivatives…
This paper is concerned with the approximation of tensors using tree-based tensor formats, which are tensor networks whose graphs are dimension partition trees. We consider Hilbert tensor spaces of multivariate functions defined on a…
Each simplicial complex and integer vector yields a vector configuration whose combinatorial properties are important for the analysis of contingency tables. We study the normality of these vector configurations including a description of…
This paper presents a novel and systematic formalism for deriving classical field equations within the framework ofcausal fermion systems, explicitly accounting for higher-order corrections such as quantum effects and those arising from…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
A new approach for the reduction of tensor integrals is described. The standard decomposition \`{a} la Davydychev is applied. Integrals with higher indices are then expressed in terms of scalar higher-dimensional integrals with generic…
Lattice gauge theories of permutation groups with a simple topological action (henceforth permutation-TFTs) have recently found several applications in the combinatorics of quantum field theories (QFTs). They have been used to solve…
The tensor rank decomposition is a useful tool for the geometric interpretation of the tensors in the canonical tensor model (CTM) of quantum gravity. In order to understand the stability of this interpretation, it is important to be able…
During the last years, low-rank tensor approximation has been established as a new tool in scientific computing to address large-scale linear and multilinear algebra problems, which would be intractable by classical techniques. This survey…
Tensor regression has attracted significant attention in statistical research. This study tackles the challenge of handling covariates with smooth varying structures. We introduce a novel framework, termed functional tensor regression,…
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…
We further develop the theory of inducing $W$-graphs worked out by Howlett and Yin in \cite{HY1}, \cite{HY2}, focusing on the case $W = \S_n$. Our main application is to give two $W$-graph versions of tensoring with the $\S_n$ defining…
In this paper we show how the covariant gauge invariant equations for the evolution of scalar, vector and tensor perturbations for a generic $f(R)$-gravity theory can be recast in order to exploit the power of dynamical system methodology.…
We develop the bivector formalism in higher dimensional Lorentzian spacetimes. We define the Weyl bivector operator in a manner consistent with its boost-weight decomposition. We then algebraically classify the Weyl tensor, which gives rise…
We present a complete algebraic classification for the curvature tensor in Weyl-Cartan geometry, by applying methods of eigenvalues and principal null directions on its irreducible decomposition under the group of global Lorentz…
The rings of SL(V) invariants of configurations of vectors and linear forms in a finite-dimensional complex vector space V were explicitly described by Hermann Weyl in the 1930s. We show that when V is 3-dimensional, each of these rings…
In this study, we introduce a tensor-train (TT) finite difference WENO method for solving compressible Euler equations. In a step-by-step manner, the tensorization of the governing equations is demonstrated. We also introduce…
Starting from an important application of Conformal Yano--Killing tensors for the existence of global charges in gravity, some new observations at $\scri^+$ are given. They allow to define asymptotic charges (at future null infinity) in…
We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a quartic speedup while using exponentially smaller space than the fastest classical…