Related papers: Improved Recursive Computation of Clebsch-Gordan C…
In this paper, a new efficient and generalized consistency correction method for weakly-compressible smoothed particle hydrodynamics is proposed and successfully implemented in the simulation of violent free-surface flow exhibiting breaking…
We compare four different methods for the numerical computation of the pure gluonic amplitudes in the Born approximation. We are in particular interested in the efficiency of the various methods as the number n of the external particles…
The decomposition of tensor products of representations into irreducibles is studied for a continuous family of integrable operator representations of $U_q(sl(2,R)$. It is described by an explicit integral transformation involving a…
In this work we consider stability of recovery of the conductivity and attenuation coefficients of the stationary Maxwell and Schr\"odinger equations from a complete set of (Cauchy) boundary data. By using complex geometrical optics…
In atomic, molecular, and nuclear physics, the method of complex coordinate rotation is a widely used theoretical tool for studying resonant states. Here, we propose a novel implementation of this method based on the gradient optimization…
The main goal of this paper is to define and study new methods for the computation of effective coefficients in the homogenization of divergence-form operators with random coefficients. The methods introduced here are proved to have optimal…
We define a set of orthogonal functions on the complex projective space CP^{N-1}, and compute their Clebsch-Gordan coefficients as well as a large class of 6-j symbols. We also provide all the needed formulae for the generation of…
Coarse-graining (CG) of molecular simulations simplifies the particle representation by grouping selected atoms into pseudo-beads and drastically accelerates simulation. However, such CG procedure induces information losses, which makes…
We prove an asymptotic formula for the recurrence coefficients of orthogonal polynomials with orthogonality measure $\log \bigl(\frac{2}{1-x}\bigr) {\rm d}x$ on $(-1,1)$. The asymptotic formula confirms a special case of a conjecture by…
A method for enhancing the stability and robustness of explicit schemes in computational fluid dynamics is presented. The method is based in reformulating explicit schemes in matrix form, which cane modified gradually into semi or…
We consider the numerical discretization of the time-domain Maxwell's equations with an energy-conserving discontinuous Galerkin finite element formulation. This particular formulation allows for higher order approximations of the electric…
We consider the quantum double D(G) of a compact group G, following an earlier paper. We use the explicit comultiplication on D(G) in order to build tensor products of irreducible *-representations. Then we study their behaviour under the…
$E_6$ is an attractive group for unification model building. However, the complexity of a rank 6 group makes it non-trivial to write down the structure of higher dimensional operators in an $E_6$ theory in terms of the states labeled by…
The inverse problems about fractional Calder\'on problem and fractional Schr\"odinger equations are of interest in the study of mathematics. In this paper, we propose the inverse problem to simultaneously reconstruct potentials and sources…
The computation of Kronecker coefficients is a challenging problem with a variety of applications. In this paper we present an approach based on methods from symplectic geometry and residue calculus. We outline a general algorithm for the…
This paper studies inverse problems in quantitative photoacoustic tomography with additional optical current data supplemented from diffuse optical tomography. We propose a three-stage image reconstruction method for the simultaneous…
We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems by learning a process representation using Kraus operators. The Kraus form ensures that the reconstructed process is completely positive.…
Modern image and video compression codes employ elaborate structures existing in such signals to encode them into few number of bits. Compressed sensing recovery algorithms on the other hand use such signals' structures to recover them from…
Communication has been seen as a significant bottleneck in industrial applications over large-scale networks. To alleviate the communication burden, sign-based optimization algorithms have gained popularity recently in both industrial and…
Many exponential speedups that have been achieved in quantum computing are obtained via hidden subgroup problems (HSPs). We show that the HSP over Weyl-Heisenberg groups can be solved efficiently on a quantum computer. These groups are…