Related papers: A recursive approach to determine correlation func…
Various numerical linear algebra problems can be formulated as evaluating bivariate function of matrices. The most notable examples are the Fr\'echet derivative along a direction, the evaluation of (univariate) functions of…
A theory is presented for a novel recursion method for O(N) ab initio tight-binding calculations. A long-standing problem of generalizing the recursion method to a non-orthogonal basis, which is a crucial step to make the recursion method…
We construct two rainbow tensor models with multi-tensors of rank-$3$ and present their $W$-representations. We give the formula of counting number of independent gauge-invariant operators in terms of Hurwitz numbers and establish a…
The multiplicative Newton-like method developed by the author et al. is extended to the situation where the dynamics is restricted to the orthogonal group. A general framework is constructed without specifying the cost function. Though the…
We describe a prescription for constructing conformal blocks in conformal field theories in any space-time dimension with arbitrary quantum numbers. Our procedure reduces the calculation of conformal blocks to constructing certain group…
The O(n) spin model in two dimensions may equivalently be formulated as a loop model, and then mapped to a height model which is conjectured to flow under the renormalization group to a conformal field theory (CFT). At the critical point,…
We emphasize the importance of choosing an appropriate correlation function to reduce numerical errors in calculating the linear-response function as a Fourier transformation of a time-dependent correlation function. As an example we take…
Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate degree composes for…
The baryon axial currents are calculated at one-loop order in heavy baryon chiral perturbation theory by employing both a cutoff and dimensional regularization. Data from the semileptonic baryon decays is used to perform a least-squares fit…
The computation of the correlation numbers in Minimal Liouville Gravity involves an integration over moduli spaces of complex curves. There are two independent approaches to the calculation: the direct one, based on the CFT methods and…
This work introduces a kernel-independent, multilevel, adaptive algorithm for efficiently evaluating a discrete convolution kernel with a given source distribution. The method is based on linear algebraic tools such as low rank…
We established a new eighth-order iterative method, consisting of three steps, for solving nonlinear equations. Per iteration the method requires four evaluations (three function evaluations and one evaluation of the first derivative).…
This study proposes a new constraint handling technique for assisting metaheuristic optimization algorithms to solve constrained optimization problems more effectively and efficiently. Given any two solutions of any constrained optimization…
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We study rate of convergence of recursive estimation procedures for the general…
This paper proposes an algorithmic framework for solving parametric optimization problems which we call adjoint-based predictor-corrector sequential convex programming. After presenting the algorithm, we prove a contraction estimate that…
We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.
Recursion formulae are derived for the calculation of two centre matrix elements of a radial function in relativistic quantum mechanics. The recursions are obtained between not necessarily diagonal radial eigensates using arbitrary radial…
We continue the study of the correlation functions for the point stochastic processes introduced in Part I (G.Olshanski, math.RT/9804086). We find an integral representation of all the correlation functions and their explicit expression in…
The division operation is important for many areas of data processing. Especially considering today's demand for hardware accelerators for machine learning algorithms, there is a high demand for an efficient calculation of the division…
We calculate within a semiclassical approximation the autocorrelation function of cross sections. The starting point is the semiclassical expression for the diagonal matrix elements of an operator. For general operators with a smooth…