Related papers: Improved Recursive Computation of Clebsch-Gordan C…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
This paper reports on a simple pure numerical method developed for computing Hansen coefficients by using recursive harmonic analysis technique. The precision criteria of the computations are very satisfactory and provide materials for…
This paper presents an accelerated composite gradient (ACG) variant, referred to as the AC-ACG method, for solving nonconvex smooth composite minimization problems. As opposed to well-known ACG variants that are either based on a known…
It has recently been shown that quantum computers can efficiently solve the Heisenberg hidden subgroup problem, a problem whose classical query complexity is exponential. This quantum algorithm was discovered within the framework of using…
By reducing the number of global synchronization bottlenecks per iteration and hiding communication behind useful computational work, pipelined Krylov subspace methods achieve significantly improved parallel scalability on present-day HPC…
We describe a fast, simple, and stable transform of Chebyshev expansion coefficients to Jacobi expansion coefficients and its inverse based on the numerical evaluation of Jacobi expansions at the Chebyshev--Lobatto points. This is achieved…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
Since numbers in the computer are represented with a fixed number of bits, loss of accuracy during calculation is unavoidable. At high precision where more bits (e.g. 64) are allocated to each number, round-off errors are typically small.…
The coefficients of fractional parentage (CFP) or Clebcsh-Gordan coefficients of the outer product of representations of the symmetric group $S_n$ are evaluated using an build up algorithm defined in terms of the chain involving the chain…
In this paper, as in our previous "Descent-cycling in Schubert calculus" math.CO/0009112, we study the structure constants in equivariant cohomology of flag manifolds G/B. In this one we give a recurrence (which is frequently, but alas not…
In this paper, we present a conforming discontinuous Galerkin (CDG) finite element method for Brinkman equations. The velocity stabilizer is removed by employing the higher degree polynomials to compute the weak gradient. The theoretical…
The Clebsch--Gordan coefficients of the Kronecker products of the irreducible representations of the Quaternion Group Q8, of the Generalized Quaternion Groups Q16 and Q32, and of the factor group (Q32 X Q32)/{(1,1),(-1,-1)} are computed as…
A coarse grid correction (CGC) approach is proposed to enhance the efficiency of the matrix exponential and $\varphi$ matrix function evaluations. The approach is intended for iterative methods computing the matrix-vector products with…
The first quantum algorithm to offer an exponential speedup (in the query complexity setting) over classical algorithms was Simon's algorithm for identifying a hidden exclusive-or mask. Here we observe how part of Simon's algorithm can be…
In practical computations, the (preconditioned) conjugate gradient (P)CG method is the iterative method of choice for solving systems of linear algebraic equations $Ax=b$ with a real symmetric positive definite matrix $A$. During the…
In this article we study the inverse problem of recovering a space-dependent coefficient of the Moore-Gibson-Thompson (MGT) equation, from knowledge of the trace of the solution on some open subset of the boundary. We obtain the Lipschitz…
It is argued that several papers where SU(3) Clebsch-Gordan coefficients were calculated in order to describe properties of hadronic systems are, up to a phase convention, particular cases of analytic formulae derived by Hecht in 1965 in…
In an effort to develop tools for grand unified model building for the Lie group $E_6$, in this paper we present the computation of the Clebsch-Gordan coefficients for the product (100000) $\otimes$ (000010), where (100000) is the…
A class of Clebsch-Gordan coefficients are derived from the properties of conditional probability using the binomial distribution. In particular, in the case of $l=l_1+l_2$ it is shown that $$[<l_1/2-k_1, l_2/2-k_2|l/2, k=k_1+k_2]>^2…
The Clebsch-Gordan and Racah-Wigner coefficients for the positive (or negative) discrete series of irreducible representations for the noncompact form $U_q(SU(1,1))$ of the algebra $U_q(sl(2))$ are computed.