{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:01:00Z","timestamp":1740099660613,"version":"3.37.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030432287"},{"type":"electronic","value":"9783030432294"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43229-4_48","type":"book-chapter","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:03:53Z","timestamp":1584576233000},"page":"567-578","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Parallel Factorization for Generating Orthogonal Matrices"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4436-8849","authenticated-orcid":false,"given":"Marek","family":"Parfieniuk","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"issue":"4","key":"48_CR1","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1137\/0908055","volume":"8","author":"T Anderson","year":"1987","unstructured":"Anderson, T., Olkin, I., Underhill, L.: Generation of random orthogonal matrices. SIAM J. Sci. Stat. Comput. 8(4), 625\u2013629 (1987)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"48_CR2","unstructured":"Arioli, M.: Tensor product of random orthogonal matrices. Technical report RAL-TR-2013-006, Science and Technology Facilities Council (2013)"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013272, October 2013","DOI":"10.1109\/BigData.2013.6691583"},{"issue":"1","key":"48_CR4","doi-asserted-by":"publisher","first-page":"1730001","DOI":"10.1142\/S2010326317300017","volume":"6","author":"P Diaconis","year":"2017","unstructured":"Diaconis, P., Forrester, P.J.: Hurwitz and the origins of random matrix theory in mathematics. Random Matrices Theory Appl. 6(1), 1730001 (2017)","journal-title":"Random Matrices Theory Appl."},{"key":"48_CR5","unstructured":"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\u201315 June 2019, pp. 1993\u20132001 (2019)"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-59657-5_13","volume-title":"Monte-Carlo and Quasi-Monte Carlo Methods 1998","author":"A Genz","year":"2000","unstructured":"Genz, A.: Methods for generating random orthogonal matrices. In: Niederreiter, H., Spanier, J. (eds.) Monte-Carlo and Quasi-Monte Carlo Methods 1998, pp. 199\u2013213. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/978-3-642-59657-5_13"},{"issue":"3","key":"48_CR7","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.parco.2005.11.001","volume":"32","author":"M Hofmann","year":"2006","unstructured":"Hofmann, M., Kontoghiorghes, E.J.: Pipeline Givens sequences for computing the QR decomposition on a EREW PRAM. Parallel Comput. 32(3), 222\u2013230 (2006)","journal-title":"Parallel Comput."},{"issue":"11","key":"48_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/2.241423","volume":"26","author":"KT Johnson","year":"1993","unstructured":"Johnson, K.T., Hurson, A.R., Shirazi, B.: General-purpose systolic arrays. Computer 26(11), 20\u201331 (1993)","journal-title":"Computer"},{"key":"48_CR9","unstructured":"Merchant, F., et al.: Efficient realization of Givens rotation through algorithm-architecture co-design for acceleration of QR factorization, March 2018. \nhttp:\/\/arxiv.org\/abs\/1803.05320"},{"issue":"5","key":"48_CR10","first-page":"592","volume":"54","author":"F Mezzadri","year":"2007","unstructured":"Mezzadri, F.: How to generate random matrices from the classical compact groups. Not. Am. Math. Soc. 54(5), 592\u2013604 (2007)","journal-title":"Not. Am. Math. Soc."},{"issue":"1","key":"48_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01389639","volume":"43","author":"JJ Modi","year":"1984","unstructured":"Modi, J.J., Clarke, M.R.B.: An alternative Givens ordering. Numer. Math. 43(1), 83\u201390 (1984). \nhttps:\/\/doi.org\/10.1007\/BF01389639","journal-title":"Numer. Math."},{"key":"48_CR12","unstructured":"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\u201319 May 2006, vol. 3, pp. 936\u2013939 (2006)"},{"issue":"11","key":"48_CR13","doi-asserted-by":"publisher","first-page":"4880","DOI":"10.1007\/s00034-018-0789-5","volume":"37","author":"M Parfieniuk","year":"2018","unstructured":"Parfieniuk, M., Park, S.Y.: Versatile quaternion multipliers based on distributed arithmetic. Circuits Syst. Signal Process. 37(11), 4880\u20134906 (2018)","journal-title":"Circuits Syst. Signal Process."},{"key":"48_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/LSP.2008.919840","volume":"15","author":"D Pinchon","year":"2008","unstructured":"Pinchon, D., Siohan, P.: Angular parameterization of real paraunitary matrices. IEEE Signal Process. Lett. 15, 353\u2013356 (2008)","journal-title":"IEEE Signal Process. Lett."},{"issue":"3","key":"48_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF00140873","volume":"6","author":"JC Pinheiro","year":"1996","unstructured":"Pinheiro, J.C., Bates, D.M.: Unconstrained parametrizations for variance-covariance matrices. Stat. Comput. 6(3), 289\u2013296 (1996)","journal-title":"Stat. Comput."},{"issue":"4","key":"48_CR16","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1137\/S0895479894276369","volume":"16","author":"X Sun","year":"1995","unstructured":"Sun, X., Bischof, C.: A basis-kernel representation of orthogonal matrices. SIAM J. Matrix Anal. Appl. 16(4), 1184\u20131196 (1995)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"48_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/13.34150","volume":"32","author":"PP Vaidyanathan","year":"1989","unstructured":"Vaidyanathan, P.P., Do\u011fanata, Z.: The role of lossless systems in modern digital signal processing: a tutorial. IEEE Trans. Educ. 32(3), 181\u2013197 (1989)","journal-title":"IEEE Trans. Educ."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43229-4_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:10:51Z","timestamp":1584576651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43229-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030432287","9783030432294"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43229-4_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ppam.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}