We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.
We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.
We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.
A tomographic reconstruction method based on Monte Carlo random searching guided by the information contained in the projections
of radiographed objects is presented. In order to solve the optimization problem, a multiscale algorithm is proposed to reduce
computation. The reconstruction is performed in a coarse-to-fine multigrid scale that initializes each resolution level with
the reconstruction of the previous coarser level, which substantially improves the performance. The method was applied to
a real case reconstructing the internal structure of a small metallic object with internal components, showing excellent results. 相似文献
The purpose of this paper is to investigate the problem of approximating fixed points of non-Lipschitizian asymptotically pseudocontractive mappings in an arbitrary real Banach space by the modified Ishikawa iterative sequences with errors. 相似文献
The adsorption of asymmetrical triblock copolymers from a non-selective solvent on solid surface has been studied by using Scheutjens-Fleer mean-field theory and Monte Carlo simulation method on lattice model. The main aim of this paper is to provide detailed computer simulation data, taking A8-kB20Ak as a key example, to study the influence of the structure of copolymer on adsorption behavior and make a comparison between MC and SF results. The simulated results show that the size distribution of various configurations and density-profile are dependent on molecular structure and adsorption energy. The molecular structure will lead to diversity of adsorption behavior. This discrepancy between different structures would be enlarged for the surface coverage and adsorption amount with increasing of the adsorption energy. The surface coverage and the adsorption amount as well as the bound fraction will become larger as symmetry of the molecular structure becomes gradually worse. The adsorption layer becomes thicker with increasing of symmetry of the molecule when adsorption energy is smaller but it becomes thinner when adsorption energy is higher. It is shown that SF theory can reproduce the adsorption behavior of asymmetrical triblock copolymers. However, systematic discrepancy between the theory and simulation still exists.The approximations inherited in the mean-filed theory such as random mixing and the allowance of direct back folding may be responsible for those deviations. 相似文献
In this paper, we suggest and analyze several iterative methods for solving general mixed quasivariational inequalities by using the technique of updating the solution and the auxiliary principle. It is shown that the convergence of these methods requires either the pseudomonotonicity or the partially relaxed strong monotonicity of the operator. Proofs of convergence is very simple. Our new methods differ from the existing methods for solving various classes of variational inequalities and related optimization problems. Various special cases are also discussed. 相似文献
In this paper, a generalized anti–maximum principle for the second order differential operator with potentials is proved. As an application, we will give a monotone iterative scheme for periodic solutions of nonlinear second order equations. Such a scheme involves the Lp norms of the growth, 1 ≤ p ≤ ∞, while the usual one is just the case p = ∞. 相似文献