Methods for Generating Random Orthogonal Matrices

  • Alan Genz


Random orthogonal matrices are used to randomize integration methods for n-dimensional integrals over spherically symmetric integration regions. Currently available methods for the generation of random orthogonal matrices are reviewed, and some methods for the generation of quasi-random orthogonal matrices are proposed. These methods all have O(n 3) time complexity. Some new methods to generate both random and quasi-random orthogonal matrices will be described and analyzed. The new methods use products of butterfly matrices, and have time complexity O(log(n)n 2). The use of these methods will be illustrated with results from the numerical computation of high-dimensional integrals from a computational finance application.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Anderson, T. W, Olkin, I, and Underhill L. G. (1987)SIAM. J. Sci. Stat. Comput.8, 625–629.CrossRefzbMATHMathSciNetGoogle Scholar
  2. Caflisch, R., and Morokoff, W. (1996), Quasi-Monte Carlo Computation of a Finance Problem, inProceedings of the Workshop on Quasi-Monte Carlo Methods and Their Applications, Statistics Research and Consultancy Unit, Hong Kong Baptist University, 15–30.Google Scholar
  3. Davis, P. J., and Rabinowitz, P. (1984),Methods of Numerical Integration, Academic Press, New York.zbMATHGoogle Scholar
  4. Fang, K.-T., and Li, R.-Z. (1997), Some Methods for Generating Both an NT-net and the Uniform Distribution on a Stiefel Manifold and Their Applications,Comp. Stat. & Data Anal.24, 29–46.CrossRefzbMATHMathSciNetGoogle Scholar
  5. Fang, K.-T., and Wang, Y. (1994)Number-Theoretic Methods in Statistics, Chapman and Hall, London, 167–170.CrossRefzbMATHGoogle Scholar
  6. Genz, A., and Monahan J. (1998), Stochastic Integration Rules for Infinite Regions,SIAM Journal on Scientific Computation,19, 426–439.CrossRefzbMATHMathSciNetGoogle Scholar
  7. Golub, G., and Van Loan, C. (1996),Matrix Computations, Johns Hopkins University Press, Baltimore.zbMATHGoogle Scholar
  8. Heiberger R. M. (1978), Algorithm AS 127: Generation of Random Orthogonal Matrices,Appi. Statist. 27, 199–206.CrossRefzbMATHGoogle Scholar
  9. Monahan, J., and Genz, A. (1997), Spherical-Radial Integration Rules for Bayesian Computation,Journal of the American Statistical Association 92, 664–674.CrossRefzbMATHGoogle Scholar
  10. Mysovskikh, I. P. (1980), The Approximation of Multiple Integrals by using Interpolatory Cubature Formulae, inQuantitative Approximation, R. A. DeVore and K. Scherer (Eds.), Academic Press, New York, 217–243.Google Scholar
  11. Mysovskikh, I. P. (1981),Interpolator Cubature Formulas(Russian), Izd Nauka, Moscow-Leningrad.Google Scholar
  12. Ökten, G. (1998), Error Estimation for Quasi-Monte Carlo Methods, inMonte Carlo and Quasi-Monte Carlo Methods 1996, Springer-Verlag, New York, 353–368.Google Scholar
  13. Parker, D. S. (1995), Random Butterfly Transformations with Applications in Computational Linear Algebra, UCLA Computer Science Department Technical Report CSD-950023.Google Scholar
  14. Shelupsky, D. (1962), An Introduction to Spherical Coordinates,American Mathematical Monthly 69, 644–646.CrossRefMathSciNetGoogle Scholar
  15. Siegel, A. F. and O’Brien, F. (1983), Unbiased Monte Carlo Integration Methods with Exactness for Low Order Polynomials,SIAM. J. Sci. Stat. Comput. 6, 169–181.CrossRefMathSciNetGoogle Scholar
  16. Stewart, G. W. (1980), The Efficient Generation of Random Orthogonal Matrices with An Application to Condition Estimation,SIAM J. Numer. Anal. 17, 403–409.CrossRefzbMATHMathSciNetGoogle Scholar
  17. Stroud, A. H. (1971),The Approximate Calculation of Multiple Integrals, Prentice Hall, Englewood Cliffs, New Jersey.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Alan Genz
    • 1
  1. 1.Department of MathematicsWashington State UniversityPullmanUSA

Personalised recommendations