相关论文: A Construction of Polynomial Lattice Rules with Sm…
Quasi-Monte Carlo methods are used for numerically integrating multivariate functions. However, the error bounds for these methods typically rely on a priori knowledge of some semi-norm of the integrand, not on the sampled function values.…
We present a branch-and-bound algorithm to improve the lower bounds obtained by SONC/SAGE. The running time is fixed-parameter tractable in the number of variables. Furthermore, we describe a new heuristic to obtain a candidate for the…
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…
The complexity of semiparametric models poses new challenges to statistical inference and model selection that frequently arise from real applications. In this work, we propose new estimation and variable selection procedures for the…
Partial differential equation is a powerful tool to characterize various physics systems. In practice, measurement errors are often present and probability models are employed to account for such uncertainties. In this paper, we present a…
The construction of modified equations is an important step in the backward error analysis of symplectic integrator for Hamiltonian systems. In the context of partial differential equations, the standard construction leads to modified…
In this short note we give incremental algorithms for the following lattice problems: finding a basis of a lattice, computing the successive minima, and determining the orthogonal decomposition. We prove an upper bound for the number of…
We present a hierarchy of tractable relaxations to obtain lower bounds on the minimum value of a polynomial over a constraint set defined by polynomial equations. In contrast to previous convex relaxation techniques for this problem, our…
Perturbative coefficients for Wilson loops and the static quark self-energy are extracted from Monte Carlo simulations at large beta on finite volumes, where all the lattice momenta are large. The Monte Carlo results are in excellent…
In this paper we present a new approach to control variates for improving computational efficiency of Ensemble Monte Carlo. We present the approach using simulation of paths of a time-dependent nonlinear stochastic equation. The core idea…
Covariance graphical lasso applies a lasso penalty on the elements of the covariance matrix. This method is useful because it not only produces sparse estimation of covariance matrix but also discovers marginal independence structures by…
We propose a variational method for constructing the eigenvalues and generalized eigenvalues for an arbitrary $N\times N$ complex matrix. The quantum part of our algorithm is based on encoding the matrix elements into the pure state of a…
We introduce an efficient, scalable Monte Carlo algorithm to simulate cross-linked architectures of freely-jointed and discrete worm-like chains. Bond movement is based on the discrete tractrix construction, which effects conformational…
We present LatNet Builder, a software tool to find good parameters for lattice rules, polynomial lattice rules, and digital nets in base 2, for quasi-Monte Carlo (QMC) and randomized quasi-Monte Carlo (RQMC) sampling over the…
The spectral representation separates the contributions of geometrical arrangement (topology) and intrinsic constituent properties in a composite. The aim of paper is to present a numerical algorithm based on the Monte Carlo integration and…
The present manuscript is concerned with component-wise estimation of the positive power of ordered restricted standard deviation of two normal populations with certain restrictions on the means. We propose several improved estimators under…
This article presents an arithmetic, called superposition relaxation, for bracketing the graph of a multivariate factorable function on a compact domain between a pair of underestimating and overestimating functions that are both separable.…
In this paper we study lattice rules which are cubature formulae to approximate integrands over the unit cube $[0,1]^s$ from a weighted reproducing kernel Hilbert space. We assume that the weights are independent random variables with a…
The folding kinetics of three-dimensional lattice Go models with side chains is studied using two different Monte Carlo move sets. A flexible move set based on single, double and triple backbone moves is found to be far superior compared to…
Perturbative coefficients for Wilson loops and the static-quark self-energy are extracted from Monte Carlo simulations at weak coupling. The lattice volumes and couplings are chosen to ensure that the lattice momenta are all perturbative.…