Related papers: Weingarten calculus with virtual isometries

Convolution is an efficient technique to obtain abstract feature representations using hierarchical layers in deep networks. Although performing convolution in Euclidean geometries is fairly straightforward, its extension to other…

Deep learning has been extensively utilized for PolSAR image classification. However, most existing methods transform the polarimetric covariance matrix into a real- or complex-valued vector to comply with standard deep learning frameworks…

We develop a numerical method for computing with orthogonal polynomials that are orthogonal on multiple, disjoint intervals for which analytical formulae are currently unknown. Our approach exploits the Fokas--Its--Kitaev Riemann--Hilbert…

In the work we propose an algorithm for a Wiener -- Hopf factorization of scalar polynomials based on notions of indices and essential polynomials. The algorithm uses computations with finite Toeplitz matrices and permits to obtain…

An algorithm is given for computing explicit formulas for the generators of relations among the invariant rational functions for vector-valued bilinear forms. These formulas have applications in the geometry of Riemannian submanifolds and…

This paper presents a systematic study of the calculus of interval-valued functions and its application to interval differential equations. To this end, first, we introduce new interval arithmetic operations. Under new operations, the space…

We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula…

We present the realization of Hurwitz algebras in terms of 2x2 vector matrices, which maintain the correspondence between the geometry of the vector spaces used in the classical physics and the underlined algebraic foundation of the quantum…

A new inverse iteration algorithm that can be used to compute all the eigenvectors of a real symmetric tri-diagonal matrix on parallel computers is developed. The modified Gram-Schmidt orthogonalization is used in the classical inverse…

Estimating the diagonal entries of a matrix, that is not directly accessible but only available as a linear operator in the form of a computer routine, is a common necessity in many computational applications, especially in image…

We apply some recent developments of Baldoni-Beck-Cochet-Vergne on vector partition function, to Kostant's and Steinberg's formulae, for classical Lie algebras $A\_r$, $B\_r$, $C\_r$, $D\_r$. We therefore get efficient {\tt Maple} programs…

This paper proposes a novel general framework of Riemannian conjugate gradient methods, that is, conjugate gradient methods on Riemannian manifolds. The conjugate gradient methods are important first-order optimization algorithms both in…

Efficient algorithms for computing linear convolutions based on the fast Fourier transform are developed. A hybrid approach is described that combines the conventional practice of explicit dealiasing (explicitly padding the input data with…

We provide two candidates for symplectic Weiss calculus based on two different, but closely related, collections of groups. In the case of the non-compact symplectic groups, i.e., automorphism groups of vector spaces with symplectic forms,…

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

In this article, we introduce a new object, a virtual quadratic space, and its group of isometries. They are presented as natural generalizations of quadratic spaces and orthogonal groups. It is then shown that by replacing quadratic spaces…

We use Seiberg--Witten-like relations in the topological recursion framework to obtain virtual Euler characteristics for uni- and multicellular maps for ensembles of classic orthogonal polynomials and for ensembles related to nonorientable…

We discuss an extension of the Weingarten formula, to the case of noncommutative homogeneous spaces, under suitable "easiness" assumptions. The spaces that we consider are noncommutative algebraic manifolds, generalizing the spaces of type…

In the present paper, we propose and analyze a novel method for estimating a univariate regression function of bounded variation. The underpinning idea is to combine two classical tools in nonparametric statistics, namely isotonic…

In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…