[{"_id":"1590","user_id":"24135","publication_identifier":{"isbn":["978-1-4503-5891-0/18/07"]},"author":[{"last_name":"Lass","full_name":"Lass, Michael","id":"24135","first_name":"Michael","orcid":"0000-0002-5708-7632"},{"full_name":"Mohr, Stephan","last_name":"Mohr","first_name":"Stephan"},{"full_name":"Wiebeler, Hendrik","last_name":"Wiebeler","first_name":"Hendrik"},{"first_name":"Thomas","id":"49079","full_name":"Kühne, Thomas","last_name":"Kühne"},{"id":"16153","last_name":"Plessl","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","first_name":"Christian"}],"conference":{"start_date":"2018-07-02","name":"Platform for Advanced Scientific Computing Conference (PASC)","location":"Basel, Switzerland","end_date":"2018-07-04"},"keyword":["approximate computing","linear algebra","matrix inversion","matrix p-th roots","numeric algorithm","parallel computing"],"project":[{"_id":"32","name":"Performance and Efficiency in HPC with Custom Computing","grant_number":"PL 595/2-1"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"publication":"Proc. Platform for Advanced Scientific Computing (PASC) Conference","citation":{"mla":"Lass, Michael, et al. “A Massively Parallel Algorithm for the Approximate Calculation of Inverse P-Th Roots of Large Sparse Matrices.” *Proc. Platform for Advanced Scientific Computing (PASC) Conference*, ACM, 2018, doi:10.1145/3218176.3218231.","chicago":"Lass, Michael, Stephan Mohr, Hendrik Wiebeler, Thomas Kühne, and Christian Plessl. “A Massively Parallel Algorithm for the Approximate Calculation of Inverse P-Th Roots of Large Sparse Matrices.” In *Proc. Platform for Advanced Scientific Computing (PASC) Conference*. New York, NY, USA: ACM, 2018. https://doi.org/10.1145/3218176.3218231.","apa":"Lass, M., Mohr, S., Wiebeler, H., Kühne, T., & Plessl, C. (2018). A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices. In *Proc. Platform for Advanced Scientific Computing (PASC) Conference*. New York, NY, USA: ACM. https://doi.org/10.1145/3218176.3218231","ama":"Lass M, Mohr S, Wiebeler H, Kühne T, Plessl C. A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices. In: *Proc. Platform for Advanced Scientific Computing (PASC) Conference*. New York, NY, USA: ACM; 2018. doi:10.1145/3218176.3218231","bibtex":"@inproceedings{Lass_Mohr_Wiebeler_Kühne_Plessl_2018, place={New York, NY, USA}, title={A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices}, DOI={10.1145/3218176.3218231}, booktitle={Proc. Platform for Advanced Scientific Computing (PASC) Conference}, publisher={ACM}, author={Lass, Michael and Mohr, Stephan and Wiebeler, Hendrik and Kühne, Thomas and Plessl, Christian}, year={2018} }","ieee":"M. Lass, S. Mohr, H. Wiebeler, T. Kühne, and C. Plessl, “A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices,” in *Proc. Platform for Advanced Scientific Computing (PASC) Conference*, Basel, Switzerland, 2018.","short":"M. Lass, S. Mohr, H. Wiebeler, T. Kühne, C. Plessl, in: Proc. Platform for Advanced Scientific Computing (PASC) Conference, ACM, New York, NY, USA, 2018."},"doi":"10.1145/3218176.3218231","type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"language":[{"iso":"eng"}],"year":"2018","date_updated":"2022-01-06T06:52:40Z","external_id":{"arxiv":["1710.10899"]},"title":"A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices","place":"New York, NY, USA","abstract":[{"text":"We present the submatrix method, a highly parallelizable method for the approximate calculation of inverse p-th roots of large sparse symmetric matrices which are required in different scientific applications. Following the idea of Approximate Computing, we allow imprecision in the final result in order to utilize the sparsity of the input matrix and to allow massively parallel execution. For an n x n matrix, the proposed algorithm allows to distribute the calculations over n nodes with only little communication overhead. The result matrix exhibits the same sparsity pattern as the input matrix, allowing for efficient reuse of allocated data structures.\r\n\r\nWe evaluate the algorithm with respect to the error that it introduces into calculated results, as well as its performance and scalability. We demonstrate that the error is relatively limited for well-conditioned matrices and that results are still valuable for error-resilient applications like preconditioning even for ill-conditioned matrices. We discuss the execution time and scaling of the algorithm on a theoretical level and present a distributed implementation of the algorithm using MPI and OpenMP. We demonstrate the scalability of this implementation by running it on a high-performance compute cluster comprised of 1024 CPU cores, showing a speedup of 665x compared to single-threaded execution.","lang":"eng"}],"publisher":"ACM","status":"public","date_created":"2018-03-22T10:53:01Z"}]