Related papers: Analysis of systematic scan Metropolis algorithms …
We show that the center of the Iwahori--Hecke algebra of the symmetric group $S_n$ carries a natural filtered algebra structure, and that the structure constants of the associated graded algebra are independent of $n$. A series of…
We present algorithms to work with iterated Eisenstein integrals that have recently appeared in the computation of multi-loop Feynman integrals. These algorithms allow one to analytically continue these integrals to all regions of the…
In complex systems such as spin systems and protein systems, conventional simulations in the canonical ensemble will get trapped in states of energy local minima. We employ the generalized-ensemble algorithms in order to overcome this…
The paper presents a comparative analysis of iterative numerical methods of Jacobi and Gauss-Seidel for solving systems of linear algebraic equations (SLAEs) with complex and real matrices. The ranges of convergence for both methods for…
The Markov chain Monte Carlo methods offer practical procedures for detecting signals characterized by a large number of parameters and under conditions of low signal-to-noise ratio. We present a Metropolis-Hastings algorithm capable of…
Using an operatorial formalism, we study the Kramers equation and its applications to numerical simulations. We obtain classes of algorithms which may be made precise at every desired order in the time step $\epsilon$ and with a set of free…
We present several implementations of the Metropolis method, an adaptive Monte Carlo algorithm, which allow for the calculation of multi-dimensional integrals over arbitrary on-shell four-momentum phase space. The Metropolis technique…
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…
We present an algorithm to compute the Hecke operators on the equivariant cohomology of an arithmetic subgroup $\Gamma$ of the general linear group $\mathrm{GL}_n$. This includes $\mathrm{GL}_n$ over a number field or a finite-dimensional…
We study the Multiple-try Metropolis algorithm using the framework of Poincar\'e inequalities. We describe the Multiple-try Metropolis as an auxiliary variable implementation of a resampling approximation to an ideal Metropolis--Hastings…
This work develops a powerful and versatile framework for determining acceptance ratios in Metropolis-Hastings type Markov kernels widely used in statistical sampling problems. Our approach allows us to derive new classes of kernels which…
We give a simple construction of Markov traces for Iwahori-Hecke algebras associated with infinite series of crystallographic Coxeter groups. In types B and D it is new, and generalizes a known construction in type A employing symmetric…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
The work is devoted to the development of numerical methods for computing "formal solutions" of interval systems of linear algebraic equations. These solutions are found in Kaucher interval arithmetic, which extends and completes the…
This paper investigates the connections between buildings and Hecke algebras through the combinatorial study of two algebras spanned by averaging operators on buildings. As a consequence we obtain a geometric and combinatorial description…
In this paper we apply methods of proof mining to obtain a highly uniform effective rate of asymptotic regularity for the Ishikawa iteration associated to nonexpansive self-mappings of convex subsets of a class of uniformly convex geodesic…
This paper addresses the problem of neighborhood selection for Gaussian graphical models. We present two heuristic algorithms: a forward-backward greedy algorithm for general Gaussian graphical models based on mutual information test, and a…
We propose an adaptive Metropolis-Hastings algorithm in which sampled data are used to update the proposal distribution. We use the samples found by the algorithm at a particular step to form the information-theoretically optimal mean-field…
In this paper, a new efficient computational algorithm is presented for solving cyclic heptadiagonal linear systems based on using of heptadiagonal linear solver and Sherman-Morrison-Woodbury formula. The implementation of the algorithm…
In this paper we present an efficient computational and symbolic algorithms for solving a backward pentadiagonal linear systems. The implementation of the algorithms using Computer Algebra Systems (CAS) such as MAPLE, MACSYMA, MATHEMATICA,…