Abstract
The results of theory and applications of optimal lattice cubature formulas are described. The approximate integration program based on lattice formulas is considered. It has sufficiently high precision for complicated domains with smooth boundaries and dimensions up to 10 and high efficiency of paralleling.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sobolev, S.L.: Introduction to the Theory of Cubature Formulas. Nauka, Moscow (1974) (in Russian)
Ramazanov, M.D.: To the L p -theory of Sobolev Formulas. Siberian Advances in Mathematics 9(1), 99–125 (1999)
Ramazanov, M.D.: Optimization of the Lattice Cubature Formula Error Functional Norm in Scale of Wiener Spaces. Reports of Russian Academy of Sciences 36(6), 743–745 (1997) (in Russian)
Ramazanov, M.D.: The Cubature Formulas of S.L. Sobolev: The Evolution of the Theory and Applications. In: International Conference on Multivariate Approximation, Haus Bommerholz, p. 33. Tech. Univ. Dortmund (2008)
Rakhmatullin, D.Y.: Integration on Multidimensional Spaces on Multiprocessing Calculating Systems. Vychislitel’nye tehnologii 11(3), 118–125 (2006) (in Russian)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ramazanov, M.D., Rakhmatullin, D.Y. (2009). Parallel Algorithms of Numeric Integration Using Lattice Cubature Formulas. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2009. Lecture Notes in Computer Science, vol 5698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03275-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-03275-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03274-5
Online ISBN: 978-3-642-03275-2
eBook Packages: Computer ScienceComputer Science (R0)