Sampling rotation groups by successive orthogonal images

SIAM Journal on Scientific Computing

Volumn 30, Issue 1, 2007, Pages 525-547

  Mitchell, Julie C ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

Dispersion; Haar measure; Orthogonal group; SO(3); SO(n); Uniform sampling

Indexed keywords

MATRIX ALGEBRA; NUMERICAL METHODS;

DETERMINISTIC SAMPLING; DETERMINISTICS; DIMENSION BOUNDS; EXACT SOLUTION; HAAR MEASURE; MATHEMATICAL DIFFICULTY; ORTHOGONAL GROUPS; ROTATION GROUP; SO(N); UNIFORM SAMPLING;

SAMPLING;

EID: 55549101290     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/030601879     Document Type: Article

References (34)

1. J. ARVO, Random Rotation Matrices, Academic Press, Boston, 1991, pp. 355-356.
2. J. ARVO, Fast Random Rotation Matrices, Academic Press, Boston, 1992, pp. 117-120.
3. F. AURENHAMMER AND H. EDELSBRUNNER, An optimal algorithm for constructing the weighted Voronoi diagram in the plane, Pattern Recognition, 17 (1984), pp. 251-257.
4. A. BARENCO, C. H. BENNETT, R. CLEVE, D. P. DIVINCENZO, N. MARGOLUS, P. SHOR, T. SLEATOR, J. A. SMOLIN, AND H. WEINFURTER, Elementary gates for quantum computation, Phys. Rev. A, 52 (1995), pp. 3457-3467.
5. A. BJORCK AND G. H. GOLUB, Numerical methods for computing angles between linear subspaces, Math. Comp., 27 (1973), pp. 579-594.
6. V. BULATOV, Point Repulsion/Sphere Tesselation Code Available, http://www.math.niu.edu/~rusin/known-math/96/repulsion (11 February 1996).
7. R. GHEN AND Z. WENG, Docking unbound proteins using shape complementarity, desolvation, and electrostatics, Prot. Struct. Pun. Gen., 47 (2002), pp. 281-294.
8. R. A. CROWTHER, The fast rotation function in the molecular replacement method, Int. Sci. Rev. Ser., 12 (1972), pp. 173-178.
9. P. DIACONIS, Patterns in eigenvalues, Bull. Amer. Math. Soc. (N.S.), 40 (2003), pp. 155-178.
10. P. DIACONIS AND M. SHAHSHAHANI, The subgroup algorithm for generating uniform random variables, Probab. Eng. Inf. Sci., 1 (1987), pp. 15-32.
11. G. L. DIRICHLET, Über die Reduktion der positiven quadratischen Formen mit drei unbestimmten ganzen Zahlen, J. Reine Angew. Math., 40 (1850), pp. 209-227.
12. B. R. DONALD, A search algorithm for motion planning with six degrees of freedom, Artif. Intell., 31 (1987), pp. 295-353.
13. R. FISHER, Dispersion on a sphere, Proc. Roy. Soc. London Ser. A, 217 (1953), pp. 295-305.
14. W. M. GENTLEMAN, Least squares computations by Givens transformations without square roots, IMA J. Appl. Math, 12 (1973), pp. 329-336.
15. G. GOLUB AND W. KAHAN, Calculating the singular values and pseudo-inverse of a matrix, SIAM J. Numer. Anal., 2 (1965), pp. 205-224.
16. D. P. HARDIN AND E. B. SAFF, Discretizing manifolds via minimum energy points, Notices Amer. Math. Soc., 51 (2004), pp. 1186-1194.
17. G. J. LANGMEAD, A. K. YAN, L. WANG, R. LILIEN, AND B. DONALD, A polynomial time nuclear vector replacement algorithm for automated NMR resonance assignments, J. Comp. Biol., 11 (2004), pp. 277-298.
18. A. LUBOTSKY, R. PHILLIPS, AND P. SARNAK, Heche operators and distributing points on the sphere I, Comm. Pure Appl. Math., 39 (1986), pp. S149-S138.
19. J. G. MANDELL, V. A. ROBERTS, M. E. PIQUE, V. KOTLOVYI, J. C. MITCHELL, E. NELSON, I. TGELNY, AND L. F. TEN EYCK, Protein docking using continuum electrostatics and geometric fit, Protein Eng., 14 (2001), pp. 105-113.
20. J. MATOUSEK, Geometric Discrepancy, Springer-Verlag, Berlin, 1999.
21. J. NAVAZA, On the fast rotation function, Acta Cryst., A43 (1987), pp. 645-653.
22. H. NIEDERREITER, Random Number Generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conf. Ser. in Appl. Math. 63, SIAM, Philadelphia, 1992.
23. J. A. NORTHBY, Structure and binding of Lennard-Jones clusters: 13 ≤ n ≤ 147, J. Chem. Phys., 87 (1987), pp. 6166-6177.
24. E. B. SAFF AND A. B. J. KUULAARS, Distributing many points on a sphere, Math. Intelligencer, 19 (1997), pp. 5-14.
25. N. J. A. SLOANE, T. S. D. R. H. HARDIN, AND J. H. CONWAY, Minimal-energy clusters of hard spheres, Discrete Comput. Geom., 14 (1995), pp. 237-259.
26. S. SMALE, Mathematical problems for the next century, Math. Intelligencer, 20 (1998), pp. 7-15.
27. G. W. STEWART, The efficient generation of random orthogonal matrices with an application to condition estimators, SIAM J. Numer. Anal., 17 (1980), p. 403-409.
28. G. VORONOI, Nouvelles applications des parametres cordinus e la theorie des formes quadratiques, J. Reine Angew. Math., 133 (1907), pp. 97-178.
29. D. WALES AND J. DOYE, Global optimization by basin-hopping and the lowest energy structures of Lennard-Jones clusters containing up to 110 atoms, J. Phys. Chem. A, 101 (1997), pp. 5111-5116.
30. H. WEYL, Über die Gleichverteilung von Zahlen mod. Eins, Math. Ann., 77 (1916), pp. 313-352.
31. S. J. WODAK AND J. JANIN, Computer analysis of protein-protein interaction, J. Mol. Biol., 124 (1978), pp. 323-342.
32. A. YAN, C. LANGMEAD, AND B. R. DONALD, A probability-based similarity measure for Saupe alignment tensors with applications to residual dipolar couplings in NMR structural biology, Int. J. Robotics Res., 24 (2005), pp. 165-182.
33. A. YERSHOVA AND S. LAVALLE, Deterministic sampling methods for spheres and SO(3), in Proceedings of the IEEE International Conference on Robotics and Automation, Vol. 4, 2004, pp. 3974-3980.
34. K. ZYCZKOWSKI AND M. KUS, Random unitary matrices, J. Phys. A, 27 (1994), pp. 4235-4245.