Related papers: Improved Recursive Computation of Clebsch-Gordan C…
Exploiting symmetries in the numerical renormalization group (NRG) method significantly enhances performance by improving accuracy, increasing computational speed, and optimizing memory efficiency. Published codes focus on continuous…
We propose a robust a posteriori error estimator for the hybridizable discontinuous Galerkin (HDG) method for convection-diffusion equations with dominant convection. The reliability and efficiency of the estimator are established for the…
Gaussian Processes (GPs) are powerful kernelized methods for non-parameteric regression used in many applications. However, their use is limited to a few thousand of training samples due to their cubic time complexity. In order to scale GPs…
We propose a recursive method for the computation of the cumulants of self-exciting point processes of Hawkes type, based on standard combinatorial tools such as Bell polynomials. This closed-form approach is easier to implement on…
Coarse grid projection (CGP) multigrid techniques are applicable to sets of equations that include at least one decoupled linear elliptic equation. In CGP, the linear elliptic equation is solved on a coarsened grid compared to the other…
The compensated quotient-difference (Compqd) algorithm is proposed along with some applications. The main motivation is based on the fact that the standard quotient-difference (qd) algorithm can be numerically unstable. The Compqd algorithm…
Dual Bernstein polynomials of one or two variables have proved to be very useful in obtaining B\'{e}zier form of the $L^2$-solution of the problem of best polynomial approximation of B\'{e}zier curve or surface. In this connection, the…
A Gaussian quantum theory of bosonic modes has been widely used to describe quantum optical systems, including coherent Ising machines (CIMs) that consist of $\chi^{(2)}$ degenerate optical parametric oscillators (DOPOs) as nonlinear…
We present a recursive algorithm for multi-coefficient inversion in nonlinear Helmholtz equations with polynomial-type nonlinearities, utilizing the linearized Dirichlet-to-Neumann map as measurement data. To achieve effective recursive…
We introduce numerical solvers for the steady-state Boltzmann equation based on the symmetric Gauss-Seidel (SGS) method. Due to the quadratic collision operator in the Boltzmann equation, the SGS method requires solving a nonlinear system…
We derive the recurrence relation of irreducible tensor operator for O(4) in using the Wigner-Eckart theorem. The physical process like radiative transitions in atomic physics, nuclear transitions between excited nuclear states can be…
A number of attempts have been made to improve accuracy and/or scalability of the PC (Peter and Clark) algorithm, some well known (Buhlmann, et al., 2010; Kalisch and Buhlmann, 2007; 2008; Zhang, 2012, to give some examples). We add here…
Representation theory for the Jordanian quantum algebra $U=U_h(sl(2))$ is developed. Closed form expressions are given for the action of the generators of U on the basis vectors of finite dimensional irreducible representations. It is shown…
Statistical mechanics of 1D multivalent Coulomb gas may be mapped onto non-Hermitian quantum mechanics. We use this example to develop instanton calculus on Riemann surfaces. Borrowing from the formalism developed in the context of…
The combined source integral equation (CSIE) for the electric field on the surface of a perfect electrically conducting scatterer can be discretized very accurately with lowest-order Rao-Wilton-Glisson basis and testing functions if the…
Recently, there has been growing interest in developing optimization methods for solving large-scale machine learning problems. Most of these problems boil down to the problem of minimizing an average of a finite set of smooth and strongly…
This work provides a proof of concept for the computation of pure gluonic amplitudes in quantum chromodynamics (QCD) on graphics processing units (GPUs). The implementation relies on the Berends-Giele recursion algorithm and, for the first…
Pascal routines are provided that generate representations of the group $SU(3)$ and tabulate the Clebsch-Gordan coefficients in the products of representations.
A numerical approach to compute tensor integrals in one-loop calculations is presented. The algorithm is based on a recursion relation which allows to express high rank tensor integrals as a function of lower rank ones. At each level of…
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…