相关论文: Multicanonical Recursions
Monte Carlo (MC) simulations of many systems, in particular those with conflicting constraints, can be considerably speeded up by using multicanonical or related methods. Some of these approaches sample with a-priori unknown weight factors.…
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 propose a wide class of recursive estimation procedures for the general…
A simple recursive scheme for parameterisation of n-by-n unitary matrices is presented.
Characteristic points have been a primary tool in the study of a generating function defined by a single recursive equation. We investigate the proper way to adapt this tool when working with multi-equation recursive systems.
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is argued that this algorithm can be superior to certain methods currently found in the literature for an important subset of problems. The…
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…
A method is presented in which matrix elements for some processes are calculated recursively. This recursive calculational technique is based on the method of basis spinors.
We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…
In this work, we study vector-valued functional equations with multiple recursive terms that arise naturally when we are dealing with vector-valued multiplicative Lindley-type recursions. We provide a detailed framework for the solution of…
We consider a certain linear recursive relation with integer parameters and study some of its algebraic and geometric properties, with the purpose of estimating the number of chains of valences in the Farey series.
The binomial multichannel algorithm is proposed. Some its properties are discussed.
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
The problem of computation of parameters of m-ary channel is considered. It is demonstrated that although the problem is ill-posed, it is possible turning of the parameters of the system and transform the problem to well-posed one.
In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…
We present further properties of a previously proposed recursive scheme for parameterisation of n-by-n unitary matrices. We show that the factors in the recursive formula may be introduced in any desired order. The method is used to study…
By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.
Most of the recent results in polynomial functional regression have been focused on an in-depth exploration of single-parameter regularization schemes. In contrast, in this study we go beyond that framework by introducing an algorithm for…
The systematic approach to solving the recurrence relations for multi-loop integrals is described. In particular, the criteria of their reducibility is suggested.
We evaluate binomial series with harmonic number coefficients, providing recursion relations, integral representations, and several examples. The results are of interest to analytic number theory, the analysis of algorithms, and…
The number of possible methods of generalizing binary classification to multi-class classification increases exponentially with the number of class labels. Often, the best method of doing so will be highly problem dependent. Here we present…