Advertisement

A Parallel Factorization for Generating Orthogonal Matrices

  • Marek ParfieniukEmail author
Conference paper
  • 141 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12043)

Abstract

A new factorization of orthogonal matrices is proposed that is based on Givens-Jacobi rotations but not on the QR decomposition. Rotations are arranged more uniformly than in the known factorizations that use them, so that more rotations can be computed in parallel, and fewer layers of concurrent rotations are necessary to model a matrix. Therefore, throughput can be increased, and latency can be reduced, compared to the known solutions, even though the obtainable gains highly depend on application specificity, software-hardware architecture and matrix size. The proposed approach allows for developing more efficient algorithms and hardware for generating random matrices, for optimizing matrices, and for processing data with linear transformations. We have verified this by implementing and evaluating a multithreaded Java application for generating random orthogonal matrices.

Keywords

Matrix Orthogonal Rotation Factorization Parallel 

Notes

Acknowledgments

This work was financially supported from the Polish Ministry of Science and Higher Education under subsidy for maintaining the research potential of the Faculty of Mathematics and Informatics, University of Bialystok.

References

  1. 1.
    Anderson, T., Olkin, I., Underhill, L.: Generation of random orthogonal matrices. SIAM J. Sci. Stat. Comput. 8(4), 625–629 (1987)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Arioli, M.: Tensor product of random orthogonal matrices. Technical report RAL-TR-2013-006, Science and Technology Facilities Council (2013)Google Scholar
  3. 3.
    Benson, A.R., Gleich, D.F., Demmel, J.: Direct QR factorizations for tall-and-skinny matrices in MapReduce architectures. In: Proceedings of the IEEE International Conference on Big Data, pp. 264–272, October 2013Google Scholar
  4. 4.
    Diaconis, P., Forrester, P.J.: Hurwitz and the origins of random matrix theory in mathematics. Random Matrices Theory Appl. 6(1), 1730001 (2017)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Frerix, T., Bruna, J.: Approximating orthogonal matrices with effective Givens factorization. In: Proceedings of the 36th International Conference on Machine Learning (ICML), Long Beach, CA, 9–15 June 2019, pp. 1993–2001 (2019)Google Scholar
  6. 6.
    Genz, A.: Methods for generating random orthogonal matrices. In: Niederreiter, H., Spanier, J. (eds.) Monte-Carlo and Quasi-Monte Carlo Methods 1998, pp. 199–213. Springer, Heidelberg (2000).  https://doi.org/10.1007/978-3-642-59657-5_13CrossRefzbMATHGoogle Scholar
  7. 7.
    Hofmann, M., Kontoghiorghes, E.J.: Pipeline Givens sequences for computing the QR decomposition on a EREW PRAM. Parallel Comput. 32(3), 222–230 (2006)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Johnson, K.T., Hurson, A.R., Shirazi, B.: General-purpose systolic arrays. Computer 26(11), 20–31 (1993)CrossRefGoogle Scholar
  9. 9.
    Merchant, F., et al.: Efficient realization of Givens rotation through algorithm-architecture co-design for acceleration of QR factorization, March 2018. http://arxiv.org/abs/1803.05320
  10. 10.
    Mezzadri, F.: How to generate random matrices from the classical compact groups. Not. Am. Math. Soc. 54(5), 592–604 (2007)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Modi, J.J., Clarke, M.R.B.: An alternative Givens ordering. Numer. Math. 43(1), 83–90 (1984).  https://doi.org/10.1007/BF01389639MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Parfieniuk, M., Petrovsky, A.: Structurally orthogonal finite precision implementation of the eight point DCT. In: Proceedings of the IEEE International Conference on Acoustics, Speech, Signal Processing (ICASSP), Toulouse, France, 14–19 May 2006, vol. 3, pp. 936–939 (2006)Google Scholar
  13. 13.
    Parfieniuk, M., Park, S.Y.: Versatile quaternion multipliers based on distributed arithmetic. Circuits Syst. Signal Process. 37(11), 4880–4906 (2018)CrossRefGoogle Scholar
  14. 14.
    Pinchon, D., Siohan, P.: Angular parameterization of real paraunitary matrices. IEEE Signal Process. Lett. 15, 353–356 (2008)CrossRefGoogle Scholar
  15. 15.
    Pinheiro, J.C., Bates, D.M.: Unconstrained parametrizations for variance-covariance matrices. Stat. Comput. 6(3), 289–296 (1996)CrossRefGoogle Scholar
  16. 16.
    Sun, X., Bischof, C.: A basis-kernel representation of orthogonal matrices. SIAM J. Matrix Anal. Appl. 16(4), 1184–1196 (1995)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Vaidyanathan, P.P., Doğanata, Z.: The role of lossless systems in modern digital signal processing: a tutorial. IEEE Trans. Educ. 32(3), 181–197 (1989)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.University of BialystokBialystokPoland

Personalised recommendations