Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
13 - A quasi-Monte Carlo method for the coagulation equation
Published online by Cambridge University Press: 18 December 2014
Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Applied Algebra and Number Theory , pp. 216 - 234Publisher: Cambridge University PressPrint publication year: 2014
References
[1] , Deterministic and stochastic models for coalescence (aggregation and coagulation): a review of the mean-field theory for probabilists. Bernoulli 5, 3–48, 1999.Google Scholar
[2] , On a Monte Carlo scheme for Smoluchowski's coagulation equation. Monte Carlo Methods Appl. 5, 1–18, 1999.Google Scholar
[3] and , Digital Nets and Sequences. Cambridge University Press, Cambridge, 2010.
[4] and , A moment methodology for coagulation and breakage problems: part 2 – moment models and distribution reconstruction. Chem. Eng. Sci. 57, 2211–2228, 2002.Google Scholar
[5] , A general mathematical survey of the coagulation equation. In: and (eds.), Topics in Current Aerosol Research, Part 2, pp. 201–376. Pergamon Press, Oxford, 1972.
[6] and , Sequences, Discrepancies and Applications. Springer-Verlag, Berlin, 1997.
[7] , Mathematical Theory of Coagulation. Lecture Notes 23. Global Analysis Research Center, Seoul National University, 1994.
[8] and , An efficient stochastic algorithm for studying coagulation dynamics and gelation phenomena. SIAM J. Sci. Comput. 22, 802–821, 2000.Google Scholar
[9] and , Stochastic particle approximations for Smoluchowski's coagulation equation. Ann. Appl. Prob. 11, 1137–1165, 2001.Google Scholar
[10] and , Numerical simulation of the Smoluchowski coagulation equation. SIAM J. Sci. Comput. 25, 2004–2028, 2004.Google Scholar
[11] , An exact method for numerically simulating the stochastic coalescence process in a cloud. J. Atmos. Sci. 32, 1977–1989, 1975.Google Scholar
[12] and , Table of Integrals, Series and Products, seventh edition. Academic Press, San Diego, CA, 2007.
[13] , Extended cell average technique for the solution of coagulation equation. J. Colloid Interface Sci. 306, 72–81, 2007.Google Scholar
[14] and , Uniform Distribution of Sequences. John Wiley & Sons, New York, 1974.
[15] and , On the solution of population balance equation by discretization – I. A fixed pivot technique. Chem. Eng. Sci. 51, 1311–1332, 1996.Google Scholar
[16] , , , and , Improved accuracy and convergence of discretized population balance for aggregation: the cell average technique. Chem.Eng.Sci. 61, 3327–3342, 2006.Google Scholar
[17] , , and , Comparison of numerical methods for solving population balance equations incorporating aggregation and breakage. Powder Technol. 189, 218–229, 2009.Google Scholar
[18] , Digital point sets: analysis and application. In: and (eds.), Random and Quasi-Random Point Sets. Lecture Notes in Statistics, volume 138, pp. 167–222. Springer-Verlag, Berlin, 1998.
[19] , A direct simulation Monte Carlo scheme and uniformly distributed sequences for solving the Boltzmann equation. Computing 41, 41–57, 1989.Google Scholar
[20] , A quasi-Monte Carlo method for the Boltzmann equation. Math. Comput. 56, 621–644, 1991.Google Scholar
[21] , Error bounds for quasi-Monte Carlo integration with nets. Math. Comput. 65, 179–187, 1996.Google Scholar
[22] and , A quasi-stochastic simulation of the general dynamics equation for aerosols. Monte Carlo Methods Appl. 13, 369–388, 2007.Google Scholar
[23] and , A quasi-Monte Carlo scheme for Smoluchowski's coagulation equation. Math. Comput. 73, 1953–1966, 2004.Google Scholar
[24] , , and , Numerical simulation of the drop size distribution in a spray. In: and (eds.), Monte Carlo and Quasi-Monte Carlo Methods 2010, pp. 503–517. Springer-Verlag, Berlin, 2012.
[25] and , Numerical and similarity solutions for reversible population balance equations with size-dependent rates. J. Colloid Interface Sci. 246, 356–365, 2002.Google Scholar
[26] , The effect of coalescence in certain collision processes. Q. J. Appl. Math. 11, 231–234, 1953.Google Scholar
[29] , Zur allgemeinen Theorie der raschen Koagulation. Kolloidchem. Beih. 27, 223–250, 1928.Google Scholar
[30] , Quasi-Monte Carlo methods and pseudo-random numbers. Bull. Am. Math. Soc. 84, 957–1041, 1978.Google Scholar
[31] , Point sets and sequences with small discrepancy. Monatsh. Math. 104, 273–337, 1987.Google Scholar
[32] , Low-discrepancy and low-dispersion sequences. J. Number Theory 30, 51–70, 1988.Google Scholar
[33] , Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia, PA, 1992.
[34] , Constructions of (t, m, s)-nets. In: and (eds.), Monte Carlo and Quasi-Monte Carlo Methods 1998, pp. 70–85. Springer-Verlag, Berlin, 2000.
[35] , Constructions of (t, m, s)-nets and (t, s)-sequences. Finite Fields Appl. 11, 578–600, 2005.Google Scholar
[36] , and , Dynamics of aerosol coagulation and condensation. AIChE J. 22, 840–851, 1976.Google Scholar
[37] , Theoretical aspects of the size distribution of fog particles. Q. J. R. Meteorol. Soc. 66, 195–207, 1940.Google Scholar
[38] , Analytic studies of cloud droplet coalescence I. J. Atmos. Sci. 25, 54–65, 1968.Google Scholar
[39] and , Constant-number Monte Carlo simulation of population balances. Chem. Eng. Sci. 53, 1777–1786, 1998.Google Scholar
[40] , Versuch einer mathematischen Theorie der Koagulationskinetik kolloider Lösungen. Z. Phys. Chem. 92, 129–168, 1916.Google Scholar
[41] , Drei Vorträge über Diffusion, Brownsche Molekularbewegung und Koagulation von Kolloidteilchen. Phys. Z. 17, 557–599, 1916.Google Scholar
[42] , , and , Agglomeration and breakage of nanoparticles in stirred media mills – a comparison of different methods and models. Chem. Eng. Sci. 61, 135–148, 2006.Google Scholar
[43] and , GPU-accelerated Monte Carlo simulation of particle coagulation based on the inverse method. J. Comput. Phys. 249, 67–79, 2013.Google Scholar
[44] , Some applications of multidimensional integration by parts. Ann. Pol. Math. 21, 85–96, 1968.Google Scholar
[45] and , A new event-driven constant-volume method for solution of the time evolution of particle size distribution. J. Comput. Phys. 228, 1412–1428, 2009.Google Scholar
[46] and , Correcting the multi-Monte Carlo method for particle coagulation. Powder Technol. 193, 120–123, 2009.Google Scholar
[47] , and , Multi-Monte Carlo method for particle coagulation: description and validation. Appl. Math. Comput. 167, 1383–1399, 2005.Google Scholar
[48] , , and , Analysis of four Monte Carlo methods for the solution of population balances in dispersed systems. Powder Technol. 173, 38–50, 2007.Google Scholar
[49] , , and , Coarse-grained computation for particle coagulation and sintering processes by linking quadrature method of moments with Monte Carlo. J. Comput. Phys. 229, 5299–5314, 2010.Google Scholar