Abstract
We present a new efficient algorithm for numerical integration over a convex polyhedron in multi-dimensional Euclidian space defined by a system of linear inequalities. The software routines which implement this algorithm are described. A numerical example of calculating an integral using these routines is given.
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
Atallah, M.J. (ed.): Algorithms and Theory of Computation Handbook. CRC Press, Boca Raton (1999)
Bharucha-Reid, A.T., Sambandham, M.: Random Polynomials. Academic Press, London (1986)
Cormen, T.H., Leiseron, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge (1994)
Kalos, M.H., Whitlock, P.A.: Monte Carlo Methods. John Wiley & Sons, Chichester (1986)
Press, W.H., Tenkovsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, Cambridge (1992)
Price, J.R.: Numerical Methods, Software and Analysis. Academic Press, London (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korenblit, M., Shmerling, E. (2006). Algorithm and Software for Integration over a Convex Polyhedron. In: Iglesias, A., Takayama, N. (eds) Mathematical Software - ICMS 2006. ICMS 2006. Lecture Notes in Computer Science, vol 4151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11832225_28
Download citation
DOI: https://doi.org/10.1007/11832225_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38084-9
Online ISBN: 978-3-540-38086-3
eBook Packages: Computer ScienceComputer Science (R0)