In this paper, we establish a deterministic error bound for estimating a functional of the solution of the integral transport equation via random walks that improves an earlier result of Chelson generalizing the Koksma-Hlawka inequality for nite dimensional quadrature. We solve such problems by simulation, using sequences that combine pseudorandom and quasirandom elements in the construction of...

Infinitely divisible random vector without Gaussian component admits representations of shot noise series. Due to possible slow convergence of the series, they have not been investigated as a device for Monte Carlo simulation. In this paper, we investigate the structure of shot noise series representations from a simulation point of view and discuss the effectiveness of quasi-Monte Carlo method...

The Hermite radial basis functions (HRBFs) implicits have been used to reconstruct surfaces from scattered Hermite data points. In this work, we propose a closed-form formulation to construct HRBF-based implicits by a quasi-solution approximating the exact solution. A scheme is developed to automatically adjust the support sizes of basis functions to hold the error bound of a quasi-solution. Ou...

Size-dependent vibrational and instability behavior of fluid-conveying magneto-electro-elastic (MEE) tubular nano-beam subjected to magneto-electric potential and thermal field has been analyzed in this study. Considering the fluid-conveying nanotube as an Euler-Bernoulli beam, fluid-structure interaction (FSI) equations are derived by using non-classical constitutive relations for MEE material...

Premorphisms are monotonic mappings between partially ordered monoids where the morphism condition φ(xy) = φ(x)φ(y) is relaxed into the condition φ(xy) ≤ φ(x)φ(y). Their use in place of morphisms has recently been advocated in situations where classical algebraic recognizability collapses. With languages of overlapping tiles, an extension of classical recognizability by morphisms, called quasi-...

The problem of finding a maximum clique in a graph is prototypical for many clustering and similarity problems; however, in many real-world scenarios, the classical problem of finding a complete subgraph needs to be relaxed to finding an almost complete subgraph, a so-called quasi-clique. In this work, we demonstrate how two previously existing definitions of quasi-cliques can be unified and ho...

Numerical simulation of the high order derivatives based on the sampling data is an important and basic problem in numerical approximation, especially for solving the differential equations numerically. The classical method is the divided difference method. However, it has been shown strongly unstable in practice. Actually, it can only be used to simulate the lower order derivatives in applicat...

The Hermite radial basis functions (HRBFs) implicits have been used to reconstruct surfaces from scattered Hermite data points. In this work, we propose a closed-form formulation to construct HRBF-based implicits by a quasi-solution approximating the exact solution. A scheme is developed to automatically adjust the support sizes of basis functions to hold the error bound of a quasi-solution. Ou...

This self-contained tutorial surveys the state of the art in quasi-Monte Carlo rendering algorithms as used for image synthesis in the product design and movie industry. Based on the number theoretic constructions of low discrepancy sequences, it explains techniques to generate light transport paths to connect cameras and light sources. Summing up their contributions on the image plane results ...