- Book Chapter
4
- 10.1016/b978-0-12-375079-2.50013-5
Chapter Thirteen - Monte Carlo Integration I: Basic Concepts
- Jan 01, 2010
- Physically Based Rendering
- Matt Pharr + 1 more +1
Chapter Thirteen - Monte Carlo Integration I: Basic Concepts
Abstract Light transport simulation in rendering is formulated as a numerical integration problem in each pixel, which is commonly estimated by Monte Carlo integration. Monte Carlo integration approximates an integral of a black‐box function by taking the average of many evaluations (i.e. samples) of the function (integrand). For N queries of the integrand, Monte Carlo integration achieves the estimation error of . Recently, Johnston [Joh16] introduced quantum super‐sampling (QSS) into rendering as a numerical integration method that can run on quantum computers. QSS breaks the fundamental limitation of the convergence rate of Monte Carlo integration and achieves the faster convergence rate of approximately which is the best possible bound of any quantum algorithms we know today [NW99]. We introduce yet another quantum numerical integration algorithm, quantum coin (QCoin) [AW99], and provide numerical experiments that are unprecedented in the fields of both quantum computing and rendering. We show that QCoin's convergence rate is equivalent to QSS's. We additionally show that QCoin is fundamentally more robust under the presence of noise in actual quantum computers due to its simpler quantum circuit and the use of fewer qubits. Considering various aspects of quantum computers, we discuss how QCoin can be a more practical alternative to QSS if we were to run light transport simulation in quantum computers in the future.
Chapter Thirteen - Monte Carlo Integration I: Basic Concepts
Chapter Thirteen - Monte Carlo Integration I: Basic Concepts
A Busy March Meeting Is Brewing in Seattle
A Busy March Meeting Is Brewing in Seattle
Applications of numerical integration in geodesy and geophysics
In this paper, two applications of numerical integration in geodesy and geophysics are presented. In the first application, the Molodenskij truncation coefficients for the Abel-Poisson kernel are computed using eleven different numerical integration procedures, namely two-, three-, four-, and five-point Gaussian, Gauss–Kronrod, trapezoidal rule, Simpson and its adaptive mode, Romberg, Lobatto, and Sard’s approximating functional numerical integration methods. The coefficients are computed for truncation degree 90, and truncation radius $$6^\circ$$ . The results are then compared with an independent method for calculating these coefficients. It is shown that numerical integration methods represent better accuracy. In the second application, the gravity accelerations at sea surface in Qeshm in southern Iran are calculated using the spherical spline numerical integration method. The formulae for spherical spline numerical integration in two different modes weighted and without weight are derived. The special case when the weight of the integral is the so-called Stokes’ kernel is thoroughly investigated. Then, the results are used to generate gravity accelerations. First, the geoid height from the sum of the mean sea level and sea surface topography is calculated. Then, a spherical spline analytical representation—with unknown coefficients—is considered for the gravity anomaly. In the next step, using the Stokes’ formula for the integral relation between geoid height and gravity anomaly, the unknown coefficients in the previous step are calculated and subsequently the gravity anomalies are derived. Adding the gravity of the reference ellipsoid to the gravity anomalies, the actual gravity accelerations at sea surface in Qeshm are calculated. To analyze the accuracy, the derived values are compared with the values observed by shipborne gravimetry. It is shown that using Bernstein polynomials as basis function for calculating numerical integration has a better accuracy than other numerical integration methods of the same degree.
Read moreA study on super-efficient Monte Carlo integration using one-dimensional chaotic maps
Monte Carlo integration is a numerical integration method using random numbers. The speed of convergence of the Monte Carlo integration can be faster by using appropriate chaotic random numbers generated by one-dimensional chaotic maps. This paper discusses the efficiency of Monte Carlo integration using chaotic random numbers generated by tent maps with a uniform distribution.
Read moreContinuous-time system modelling using the weighted-parabola-overlapping numerical integration method
Numerical integration is a widely used method in scientific areas where the uniform integral interval can be selected optionally. Simpson integration and Newton-Cotes formula, for example, are available in many textbooks and software. However, in system science, the data may come from practical sampled continuous systems. Sometimes the sampling interval is non-uniform and the integration values at each sampled point are needed. For example, when the parameters of a continuous system model need to be estimated by least squares, we want the integration value at each sampling point. In that case, trapezoidal numerical integration is mostly adopted, which has only first-order algebraic accuracy (the straight line). When sampled points are fewer, the errors of numerical integration such as noise can interfere with the modelling. We propose a weighted-parabola-overlapping (WPO) numerical integration method, which possesses third-order algebraic accuracy and needs nearly the same computation of second-order power function curve fitting (the parabola). The proposed method is applicable to non-uniformly sampled systems. As a specific case, it is as adequate as uniformly sampled systems and the expression becomes very simple. Two examples are given: one is the identification of a non-uniformly sampled system by least-squares (LS), the other is local cerebral blood flow (LCBF) measurement with positron emission tomography (PET) by the integrated projection (IP) technique. Both are non-uniformly sampled systems and have very few data.
Read moreCutting-Edge Stochastic Approach: Efficient Monte Carlo Algorithms with Applications to Sensitivity Analysis
Many important practical problems connected to energy efficiency in buildings, ecology, metallurgy, the development of wireless communication systems, the optimization of radar technology, quantum computing, pharmacology, and seismology are described by large-scale mathematical models that are typically represented by systems of partial differential equations. Such systems often involve numerous input parameters. It is crucial to understand how susceptible the solutions are to uncontrolled variations or uncertainties within these input parameters. This knowledge helps in identifying critical factors that significantly influence the model’s outcomes and can guide efforts to improve the accuracy and reliability of predictions. Sensitivity analysis (SA) is a method used efficiently to assess the sensitivity of the output results from large-scale mathematical models to uncertainties in their input data. By performing SA, we can better manage risks associated with uncertain inputs and make more informed decisions based on the model’s outputs. In recent years, researchers have developed advanced algorithms based on the analysis of variance (ANOVA) technique for computing numerical sensitivity indicators. These methods have also incorporated computationally efficient Monte Carlo integration techniques. This paper presents a comprehensive theoretical and experimental investigation of Monte Carlo algorithms based on “symmetrized shaking” of Sobol’s quasi-random sequences. The theoretical proof demonstrates that these algorithms exhibit an optimal rate of convergence for functions with continuous and bounded first derivatives and for functions with continuous and bounded second derivatives, respectively, both in terms of probability and mean square error. For the purposes of numerical study, these approaches were successfully applied to a particular problem. A specialized software tool for the global sensitivity analysis of an air pollution mathematical model was developed. Sensitivity analyses were conducted regarding some important air pollutant levels, calculated using a large-scale mathematical model describing the long-distance transport of air pollutants—the Unified Danish Eulerian Model (UNI-DEM). The sensitivity of the model was explored focusing on two distinct categories of key input parameters: chemical reaction rates and input emissions. To validate the theoretical findings and study the applicability of the algorithms across diverse problem classes, extensive numerical experiments were conducted to calculate the main sensitivity indicators—Sobol’ global sensitivity indices. Various numerical integration algorithms were employed to meet this goal—Monte Carlo, quasi-Monte Carlo (QMC), scrambled quasi-Monte Carlo methods based on Sobol’s sequences, and a sensitivity analysis approach implemented in the SIMLAB software for sensitivity analysis. During the study, an essential task arose that is small in value sensitivity measures. It required numerical integration approaches with higher accuracy to ensure reliable predictions based on a specific mathematical model, defining a vital role for small sensitivity measures. Both the analysis and numerical results highlight the advantages of one of the proposed approaches in terms of accuracy and efficiency, particularly for relatively small sensitivity indices.
Read moreOn the accuracy of estimating pest insect abundance from data with random error
On the accuracy of estimating pest insect abundance from data with random error
Quantum Monte Carlo Integration: The Full Advantage in Minimal Circuit Depth
This paper proposes a method of quantum Monte Carlo integration that retains the full quadratic quantum advantage, without requiring any arithmetic or quantum phase estimation to be performed on the quantum computer. No previous proposal for quantum Monte Carlo integration has achieved all of these at once. The heart of the proposed method is a Fourier series decomposition of the sum that approximates the expectation in Monte Carlo integration, with each component then estimated individually using quantum amplitude estimation. The main result is presented as theoretical statement of asymptotic advantage, and numerical results are also included to illustrate the practical benefits of the proposed method. The method presented in this paper is the subject of a patent application [Quantum Computing System and Method: Patent application GB2102902.0 and SE2130060-3].
Read moreIntroduction to Quantum Computation and Information
From the Publisher: This book aims to provide a pedagogical introduction to the subjects of quantum information and computation. Topics include non-locality of quantum mechanics, quantum computation, quantum cryptography, quantum error correction, fault-tolerant quantum computation as well as some experimental aspects of quantum computation and quantum cryptography. Only knowledge of basic quantum mechanics is assumed. Whenever more advanced concepts and techniques are used, they are introduced carefully. This book is meant to be a self-contained overview. While basic concepts are discussed in detail, unnecessary technical details are excluded. It is well-suited for a wide audience ranging from physics graduate students to advanced researchers.
Read moreA New Method of Numerical Integration
We present an approach to solve numerical integration. The theorem to solve numerical integration is proven. This paper also gives the examples of numerical integration. The results show that numerical integration method presented in this paper has a high accuracy, hence, its application values is significant in the engineering practice.
Read moreAn efficient numerical integration system for stiff unified constitutive equations for metal forming applications
Unified constitutive equations have been developed in recent years to predict viscoplastic flow and microstructural evolution of metal alloys for metal forming applications. These equations can be implemented into commercial FE code, such as ABAQUS and PAMSTAMP, to predict mechanical and physical properties of materials in a wide range of metal forming processes. These equations are normally stiff and need significant computer CPU time to solve. In this research, a series of numerical analyses are performed to investigate the difficulties within MATLAB of solving these stiff unified constitutive equations. A metric is introduced to allow evaluation of the numerical stiffness to assess the most appropriate numerical integration method. This metric is based on the ratio of maximum to minimum eigenvalue. This metric allows for an appropriate numerical method to be chosen giving more effective modelling of deformation and plasticity processes. Based on the theoretical work described above, a user-friendly system, based on MATLAB, is then developed for numerically integrating these types of stiff constitutive equations. This is particularly useful for metal forming engineers and researchers who need an effective computational tool to determine constitutive properties well based on numerical integration theories.
Read moreError Bounds for Reconstruction of a Function f from a Finite Sequence $\{ \operatorname{sgn} ( f( t_i ) + x_i ) \}$
Consider reconstructing a function $f( t ),0\leqq t\leqq 1$, from knowledge only of $\{ ( t_i ,s_i ),1\leqq i\leqq n \}$, where $s_i = \operatorname{sgn} ( f( t_i ) + x_i )$, $1\leqq i\leqq n$, and the $x_i $ are additive “corruptions.” Without the components $x_i $, f could not be reconstructed. However, for f continuous and for random uniform noise x, Masry and Cambanis (IEEE Trans. Inform. Theory, IT-26 (1980), pp. 50–58; IT-27 (1981), pp. 84–96) show that f can be consistently estimated almost surely and in mean square as $n \to \infty $ and establish rates of pointwise convergence. Through a somewhat different treatment, in which the approximation of $f( t_i )$ is identified as a numerical integration problem rather than a statistical problem, we obtain simple exact bounds on the error of estimation, allow the noise x to be arbitrary (random or deterministic) and deal with the case of f having discontinuities. The bounds yield substantially improved rates of convergence when the noise values $x_i $, ...
Read moreA novel numerical integrator for velocity and position estimation
Velocity and position are the most important signals used in industrial controllers such as proportional–integral–derivative controllers. While in some real-time applications like structural control, acceleration measurements are easily accessible via accelerometers. The velocity and position have to be estimated from the measured acceleration. In this paper, offset cancellation and high-pass filtering techniques are combined effectively to solve common problems in numerical integration of acceleration signals in real-time applications. The integration accuracy is improved compared with other numerical integrators. Experimental results on a linear servo actuator and a shake table illustrate the effectiveness of the proposed method.
Read moreNumerical integrator for inertial sensors in smartphone with application to tele-manipulation of robot
In order to design a small size, cheap, space sensing, and wireless communication human machine interface (HMI), we developed a smartphone-based system. It uses the accelerometer and the gyroscope of the smartphone to generate six commands. The velocity and position have to be estimated using the measured acceleration. In this paper, offset cancellation and high-pass filtering techniques are combined effectively to solve common problems in numerical integration of acceleration signals in real-time applications. The integration accuracy is improved compared with other numerical integrators.
Read moreBig data and quantum computation
With the explosion of big data, higher requirements for computational efficiency have emerged. Compared with classical computing, quantum computing possesses quantum parallelism due to the unique nature of quantum systems. It has been found that many classical algorithms can be accelerated using quantum computing. In addition to factorizing a large integer, quantum computers can be used for data processing and analysis. In recent years, two frontiers, i.e., big data and quantum computing have begun to merge. Though practical quantum computers have not yet been built, theoretical studies have made some important progress. In this review, we introduce the basic principles of quantum computing. As a representative example, we describe the Grover search algorithm and its important generalizations. Quantum machine learning is the entry point for the integration of big data with quantum computation. We review in detail, the applications of quantum computation in data mining, the main application of machine learning. Other aspects of quantum computing in big data are also briefly summarized.
Read more