{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T05:50:28Z","timestamp":1775541028378,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T00:00:00Z","timestamp":1530489600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["716142"],"award-info":[{"award-number":["716142"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["PL 595\/2-1"],"award-info":[{"award-number":["PL 595\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,2]]},"DOI":"10.1145\/3218176.3218231","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T12:12:39Z","timestamp":1529496759000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices"],"prefix":"10.1145","author":[{"given":"Michael","family":"Lass","sequence":"first","affiliation":[{"name":"Department of Computer Science, Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Mohr","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"Wiebeler","sequence":"additional","affiliation":[{"name":"Department of Chemistry, Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas D.","family":"K\u00fchne","sequence":"additional","affiliation":[{"name":"Department of Chemistry, Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Plessl","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. SUPERCOMPUTING '90","author":"Angerson E."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/42792"},{"key":"e_1_3_2_1_3_1","first-page":"31","article-title":"Parallel algorithms for the singular value decomposition","volume":"184","author":"Berry Michael W","year":"2006","journal-title":"Statistics Textbooks and Monographs"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-004-6709-8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/369028.369038"},{"key":"e_1_3_2_1_6_1","unstructured":"T.H. Cormen C.E. Leiserson R.L. Rivest and C. Stein. 2009. Introduction to Algorithms (3 ed.). MIT Press.   T.H. Cormen C.E. Leiserson R.L. Rivest and C. Stein. 2009. Introduction to Algorithms (3 ed.). MIT Press."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/99.660313"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2132876.2132885"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Stefan Goedecker. 1999. Linear scaling electronic structure methods. Reviews of Modern Physics 71 (Jul 1999) 1085--1123. Issue 4.  Stefan Goedecker. 1999. Linear scaling electronic structure methods. Reviews of Modern Physics 71 (Jul 1999) 1085--1123. Issue 4.","DOI":"10.1103\/RevModPhys.71.1085"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/10081232X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/130906118"},{"key":"e_1_3_2_1_13_1","unstructured":"Intel. 2017. Math Kernel Library. http:\/\/www.intel.com\/software\/products\/mkl\/  Intel. 2017. Math Kernel Library. http:\/\/www.intel.com\/software\/products\/mkl\/"},{"key":"e_1_3_2_1_14_1","unstructured":"Intel. 2017. MPI Library. https:\/\/software.intel.com\/en-us\/intel-mpi-library  Intel. 2017. MPI Library. https:\/\/software.intel.com\/en-us\/intel-mpi-library"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2013.0278"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"W. Kohn. 1999. Nobel Lecture: Electronic structure of matter - wave functions and density functionals. Reviews of Modern Physics 71 (Oct 1999) 1253--1266. Issue 5.  W. Kohn. 1999. Nobel Lecture: Electronic structure of matter - wave functions and density functionals. Reviews of Modern Physics 71 (Oct 1999) 1253--1266. Issue 5.","DOI":"10.1103\/RevModPhys.71.1253"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92859-1_3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.045.026"},{"key":"e_1_3_2_1_19_1","unstructured":"Michael Lass Thomas D. K\u00fchne and Christian Plessl. 2017. Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots. IEEE Embedded Systems Letters (2017). arXiv:1703.02283 Accepted for publication.  Michael Lass Thomas D. K\u00fchne and Christian Plessl. 2017. Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots. IEEE Embedded Systems Letters (2017). arXiv:1703.02283 Accepted for publication."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"R.B. Lehoucq D.C. Sorensen and C. Yang. 1998. ARPACK Users' Guide: Solution of Large-scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. Society for Industrial and Applied Mathematics.  R.B. Lehoucq D.C. Sorensen and C. Yang. 1998. ARPACK Users' Guide: Solution of Large-scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9780898719628"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/09077432X"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/645780.666353"},{"key":"e_1_3_2_1_24_1","volume-title":"MPI: A Message-Passing Interface Standard. Technical Report","author":"Interface Forum Message Passing","year":"1994"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jctc.7b00348"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.4871876"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. of the National academy of Sciences of the United States of America 102","author":"Prodan E.","year":"2005"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.4869865"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Dorothee Richters Michael Lass Andrea Walther Christian Plessl and Thomas D. K\u00fchne.2018. A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices. Communications in Computational Physics (2018). arXiv:1703.02456 Accepted for publication.  Dorothee Richters Michael Lass Andrea Walther Christian Plessl and Thomas D. K\u00fchne.2018. A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices. Communications in Computational Physics (2018). arXiv:1703.02456 Accepted for publication.","DOI":"10.4208\/cicp.OA-2018-0053"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"G. Schulz. 1933. Iterative Berechung der reziproken Matrix. ZAMM - Zeitschrift fur Angewandte Mathematik und Mechanik (1933).  G. Schulz. 1933. Iterative Berechung der reziproken Matrix. ZAMM - Zeitschrift fur Angewandte Mathematik und Mechanik (1933).","DOI":"10.1002\/zamm.19330130111"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.07.001"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0614059"}],"event":{"name":"PASC '18: Platform for Advanced Scientific Computing Conference","location":"Basel Switzerland","acronym":"PASC '18","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","CSCS Swiss National Supercomputing Centre","ETH Zurich Federal Institute of Technology - University of Zurich"]},"container-title":["Proceedings of the Platform for Advanced Scientific Computing Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3218176.3218231","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3218176.3218231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:26Z","timestamp":1750212446000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3218176.3218231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,2]]},"references-count":32,"alternative-id":["10.1145\/3218176.3218231","10.1145\/3218176"],"URL":"https:\/\/doi.org\/10.1145\/3218176.3218231","relation":{},"subject":[],"published":{"date-parts":[[2018,7,2]]},"assertion":[{"value":"2018-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}