{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T04:13:59Z","timestamp":1743567239605,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031857027","type":"print"},{"value":"9783031857034","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-85703-4_14","type":"book-chapter","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T03:31:27Z","timestamp":1743564687000},"page":"205-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Preconditioning of\u00a0the\u00a0One-Sided Block-Jacobi SVD Algorithm by\u00a0Polar Decomposition"],"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":[[2025,4,1]]},"reference":[{"key":"14_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":"14_CR2","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. Ser. 25, 1\u201319 (2015). https:\/\/doi.org\/10.1142\/S0129626415500036","journal-title":"Parallel Proc. Lett. Ser."},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Be\u010dka, M., Ok\u0161a, G., Vidli\u010dkov\u00e1, E.: New preconditioning for the one-sided block-Jacobi SVD algorithm. In: Wyrzykowski, R., et al.: PPAM17, Springer Nature, LNCS 10777, 590\u2013599 (2018). https:\/\/doi.org\/10.1007\/978-3-310-78024-5_51","DOI":"10.1007\/978-3-310-78024-5_51"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-030-43229-4_47","volume-title":"Parallel Processing and Applied Mathematics","author":"M Be\u010dka","year":"2020","unstructured":"Be\u010dka, M., Ok\u0161a, G.: Preconditioned Jacobi SVD Algorithm Outperforms PDGESVD. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K. (eds.) PPAM 2019. LNCS, vol. 12043, pp. 555\u2013566. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43229-4_47"},{"key":"14_CR5","doi-asserted-by":"publisher","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":"14_CR6","doi-asserted-by":"publisher","first-page":"2700","DOI":"10.1137\/090774999","volume":"31","author":"Y Nakatsukasa","year":"2010","unstructured":"Nakatsukasa, Y., Bai, Z., Gygi, F.: Optimizing Halley\u2019s iteration for computing the matrix polar decomposition. SIAM J. Matrix Anal. Appl. Ser. 31, 2700\u20132720 (2010). https:\/\/doi.org\/10.1137\/090774999","journal-title":"SIAM J. Matrix Anal. Appl. Ser."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1137\/11085754","volume":"33","author":"Y Nakatsukasa","year":"2012","unstructured":"Nakatsukasa, Y., Higham, N.J.: Backward stability of iterations for computing the polar decomposition. SIAM J. Matrix Anal. Appl. Ser. 33, 460\u2013479 (2012). https:\/\/doi.org\/10.1137\/11085754","journal-title":"SIAM J. Matrix Anal. Appl. Ser."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"A1325","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. series 35, A1325\u2013A1349 (2013). https:\/\/doi.org\/10.1137\/120876605","journal-title":"SIAM J. Sci. Comput. series"},{"key":"14_CR9","unstructured":"http:\/\/www.openblas.net"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Schreiber, R., Van Loan, Ch.: A storage-efficient WY representation for products of Householder transformations. SIAM J. Sci. Comput. 10 (1989). https:\/\/doi.org\/10.1137\/0910005","DOI":"10.1137\/0910005"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-85703-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T03:31:29Z","timestamp":1743564689000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-85703-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031857027","9783031857034"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-85703-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 April 2025","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":"Ostrava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppam.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}