{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T16:27:31Z","timestamp":1743784051651},"publisher-location":"Cham","reference-count":13,"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_47","type":"book-chapter","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T20:03:53Z","timestamp":1584561833000},"page":"555-566","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Preconditioned Jacobi SVD Algorithm Outperforms PDGESVD"],"prefix":"10.1007","author":[{"given":"Martin","family":"Be\u010dka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Ok\u0161a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"key":"47_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK Users\u2019 Guide","author":"A Anderson","year":"1999","unstructured":"Anderson, A., et al.: LAPACK Users\u2019 Guide, 3rd edn. SIAM, Philadelphia (1999)","edition":"3"},{"key":"47_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-319-78024-5_51","volume-title":"Parallel Processing and Applied Mathematics","author":"M Be\u010dka","year":"2018","unstructured":"Be\u010dka, M., Ok\u0161a, G., Vidli\u010dkov\u00e1, E.: New preconditioning for the one-sided block-Jacobi SVD algorithm. In: Wyrzykowski, R., Dongarra, J., Deelman, E., Karczewski, K. (eds.) PPAM 2017. LNCS, vol. 10777, pp. 590\u2013599. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78024-5_51"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0167-8191(01)00138-7","volume":"28","author":"M Be\u010dka","year":"2002","unstructured":"Be\u010dka, M., Ok\u0161a, G., Vajter\u0161ic, M.: Dynamic ordering for a parallel block Jacobi SVD algorithm. Parallel Comput. 28, 243\u2013262 (2002). https:\/\/doi.org\/10.1016\/S0167-8191(01)00138-7","journal-title":"Parallel Comput."},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0129626415500036","volume":"25","author":"M Be\u010dka","year":"2015","unstructured":"Be\u010dka, M., Ok\u0161a, G., Vajter\u0161ic, M.: New dynamic orderings for the parallel one-sided block-Jacobi SVD algorithm. Parallel Proc. Lett. 25, 1\u201319 (2015). https:\/\/doi.org\/10.1142\/S0129626415500036","journal-title":"Parallel Proc. Lett."},{"key":"47_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-55224-3_6","volume-title":"Parallel Processing and Applied Mathematics","author":"M Be\u010dka","year":"2014","unstructured":"Be\u010dka, M., Ok\u0161a, G.: Parallel one-sided Jacobi SVD algorithm with variable blocking factor. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wa\u015bniewski, J. (eds.) PPAM 2013. LNCS, vol. 8384, pp. 57\u201366. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55224-3_6"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/17M1117732","volume":"60","author":"J Dongarra","year":"2018","unstructured":"Dongarra, J., et al.: The singular value decomposition: anatomy of optimizing an algorithm for extreme scale. SIAM Rev. 60, 808\u2013865 (2018). https:\/\/doi.org\/10.1137\/17M1117732","journal-title":"SIAM Rev."},{"key":"47_CR7","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., van Loan, C.F.: Matrix Computations, 4th edn. The John Hopkins University Press, Baltimore (2013)","edition":"4"},{"key":"47_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia (2002)","edition":"2"},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s11075-006-9022-x","volume":"42","author":"Z Jia","year":"2006","unstructured":"Jia, Z.: Using cross-product matrices to compute the SVD. Numer. Algorithms 42, 31\u201361 (2006). https:\/\/doi.org\/10.1007\/s11075-006-9022-x","journal-title":"Numer. Algorithms"},{"key":"47_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/cpe.4059","volume":"29","author":"S Kudo","year":"2017","unstructured":"Kudo, S., Yamamoto, Y., Be\u010dka, M., Vajter\u0161ic, M.: Performance analysis and optimization of the parallel one-sided block-Jacobi algorithm with dynamic ordering and variable blocking. Concurr. Comput. Pract. Exp. 29, 1\u201324 (2017). https:\/\/doi.org\/10.1002\/cpe.4059","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1137\/120876605","volume":"35","author":"Y Nakatsukasa","year":"2013","unstructured":"Nakatsukasa, Y., Higham, N.J.: Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD. SIAM J. Sci. Comput. 35, 1325\u20131349 (2013). https:\/\/doi.org\/10.1137\/120876605","journal-title":"SIAM J. Sci. Comput."},{"key":"47_CR12","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1007\/s00211-016-0863-5","volume":"136","author":"G Ok\u0161a","year":"2017","unstructured":"Ok\u0161a, G., Yamamoto, Y., Vajter\u0161ic, M.: Asymptotic quadratic convergence of the block-Jacobi EVD algorithm for Hermitian matrices. Numer. Math. 136, 1071\u20131095 (2017). https:\/\/doi.org\/10.1007\/s00211-016-0863-5","journal-title":"Numer. Math."},{"key":"47_CR13","unstructured":"http:\/\/www.openblas.net"}],"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_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T16:34:37Z","timestamp":1695918877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43229-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030432287","9783030432294"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43229-4_47","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)"}}]}}