相关论文: A constructive algorithm for the Cartan decomposit…
This paper studies the Craig variant of the Golub-Kahan bidiagonalization algorithm as an iterative solver for linear systems with saddle point structure. Such symmetric indefinite systems in 2x2 block form arise in many applications, but…
The purpose of this paper is to point the effectiveness of the Jordan-Chevalley decomposition, i.e. the decomposition of a square matrix $U$ with coefficients in a field $k$ containing the eigenvalues of $U$ as a sum $U=D+N,$ where $D$ is a…
We develop a holonomy reduction procedure for general Cartan geometries. We show that, given a reduction of holonomy, the underlying manifold naturally decomposes into a disjoint union of initial submanifolds. Each such submanifold…
We describe a simple algorithm for computing the canonical basis of any finite-dimensional $U_{q}(sp_{2n})$-module.
This is the lecture 3 of a mini-course of 4 lectures. Our purpose of this mini-curse is to explain some ideas of E. Cartan and S. Lie when we study differential geometry, particularly we will to explain the Cartan reduction method. The…
This is the lecture 1 of a mini-course of 4 lectures. Our purpose of this mini-curse is to explain some ideas of E. Cartan and S. Lie when we study differential geometry, particularly we will to explain the Cartan reduction method. The…
In the present note we suggest an affinization of a theorem by Kostrikin et.al. about the decomposition of some complex simple Lie algebras ${\cal G}$ into the algebraic sum of pairwise orthogonal Cartan subalgebras. We point out that the…
In this paper, we propose a method to decompose an integral self-affine ${\mathbb Z}^n$-tiling set $K$ into measure disjoint pieces $K_j$ satisfying $K=\displaystyle\bigcup K_j$ in such a way that the collection of sets $K_j$ forms an…
In this paper we obtain a 2+2 double null Hamiltonian description of General Relativity using only the (complex) SO(3) connection and the components of the complex densitised self-dual bivectors. We carry out the general canonical analysis…
The sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis, and sparse canonical correlation analysis.…
Group elements of SU(2) are expressed in closed form as finite polynomials of the Lie algebra generators, for all definite spin representations of the rotation group. The simple explicit result exhibits connections between group theory,…
In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
Decomposing a matrix into a weighted sum of Pauli strings is a common chore of the quantum computer scientist, whom is not easily discouraged by exponential scaling. But beware, a naive decomposition can be cubically more expensive than…
In this paper we present an efficient algorithm to compute the eigen decomposition of a matrix that is a weighted sum of the self outer products of vectors such as a covariance matrix of data. A well known algorithm to compute the eigen…
We present an algorithm for the explicit numerical calculation of SU(N) and SL(N,C) Clebsch-Gordan coefficients, based on the Gelfand-Tsetlin pattern calculus. Our algorithm is well-suited for numerical implementation; we include a computer…
The irreducible representations of SU(N) over a mixed quark-antiquark Fock space component have been studied for many years. In analogy to the case for the quark-only Fock space component, there exist efficient tools to classify the…
We propose a novel factorization of a non-singular matrix $P$, viewed as a $2\times 2$-blocked matrix. The factorization decomposes $P$ into a product of three matrices that are lower block-unitriangular, upper block-triangular, and lower…
A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G(1), \ldots , G(k)$. It is called an $r$-factorization if every $G(i)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said…
We show that for all graphs H of size n, the complete graph $K_{2n+1}$ has an $H$-decomposition.