[{"project":[{"_id":"32","name":"Performance and Efficiency in HPC with Custom Computing"}],"author":[{"first_name":"Dorothee","last_name":"Richters"},{"last_name":"Lass","first_name":"Michael","id":"24135","orcid":"0000-0002-5708-7632"},{"first_name":"Andrea","last_name":"Walther"},{"last_name":"Plessl","first_name":"Christian","orcid":"0000-0001-5728-9982","id":"16153"},{"id":"49079","first_name":"Thomas","last_name":"Kühne"}],"citation":{"bibtex":"@article{Richters_Lass_Walther_Plessl_Kühne_2019, title={A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices}, volume={25}, DOI={10.4208/cicp.OA-2018-0053}, number={2}, journal={Communications in Computational Physics}, publisher={Global Science Press}, author={Richters, Dorothee and Lass, Michael and Walther, Andrea and Plessl, Christian and Kühne, Thomas}, year={2019}, pages={564–585} }","chicago":"Richters, Dorothee, Michael Lass, Andrea Walther, Christian Plessl, and Thomas Kühne. “A General Algorithm to Calculate the Inverse Principal P-Th Root of Symmetric Positive Definite Matrices.” *Communications in Computational Physics* 25, no. 2 (2019): 564–85. https://doi.org/10.4208/cicp.OA-2018-0053.","short":"D. Richters, M. Lass, A. Walther, C. Plessl, T. Kühne, Communications in Computational Physics 25 (2019) 564–585.","mla":"Richters, Dorothee, et al. “A General Algorithm to Calculate the Inverse Principal P-Th Root of Symmetric Positive Definite Matrices.” *Communications in Computational Physics*, vol. 25, no. 2, Global Science Press, 2019, pp. 564–85, doi:10.4208/cicp.OA-2018-0053.","apa":"Richters, D., Lass, M., Walther, A., Plessl, C., & Kühne, T. (2019). A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices. *Communications in Computational Physics*, *25*(2), 564–585. https://doi.org/10.4208/cicp.OA-2018-0053","ieee":"D. Richters, M. Lass, A. Walther, C. Plessl, and T. Kühne, “A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices,” *Communications in Computational Physics*, vol. 25, no. 2, pp. 564–585, 2019."},"_id":"21","dini_type":"doc-type:article","publication":"Communications in Computational Physics","date_updated":"2019-01-03T13:12:46Z","_version":13,"date_created":"2017-07-25T14:48:26Z","volume":25,"abstract":[{"lang":"eng"}],"page":"564-585","language":[{}],"creator":{"login":"lass","id":"24135"},"status":"public","issue":"2","type":"journal_article","user_id":"24135","department":[{"tree":[{"_id":"216"},{"_id":"43"}],"_id":"27"},{"tree":[{"_id":"7"},{"_id":"34"},{"_id":"44"},{"_id":"43"}],"_id":"518"},{"_id":"304","tree":[{"_id":"613"},{"_id":"2"},{"_id":"35"},{"_id":"44"},{"_id":"43"}]},{"tree":[{"_id":"99"},{"_id":"10"},{"_id":"34"},{"_id":"44"},{"_id":"43"}],"_id":"104"}],"intvolume":" 25","uri_base":"https://ris.uni-paderborn.de","dc":{"title":["A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices"],"type":["info:eu-repo/semantics/article","doc-type:article","text"],"source":["Richters D, Lass M, Walther A, Plessl C, Kühne T. A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices. *Communications in Computational Physics*. 2019;25(2):564-585. doi:10.4208/cicp.OA-2018-0053"],"publisher":["Global Science Press"],"rights":["info:eu-repo/semantics/closedAccess"],"identifier":["https://ris.uni-paderborn.de/record/21"],"creator":["Richters, Dorothee","Lass, Michael","Walther, Andrea","Plessl, Christian","Kühne, Thomas"],"language":["eng"],"description":["We address the general mathematical problem of computing the inverse p-th\r\nroot of a given matrix in an efficient way. A new method to construct iteration\r\nfunctions that allow calculating arbitrary p-th roots and their inverses of\r\nsymmetric positive definite matrices is presented. We show that the order of\r\nconvergence is at least quadratic and that adaptively adjusting a parameter q\r\nalways leads to an even faster convergence. In this way, a better performance\r\nthan with previously known iteration schemes is achieved. The efficiency of the\r\niterative functions is demonstrated for various matrices with different\r\ndensities, condition numbers and spectral radii."],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.4208/cicp.OA-2018-0053","info:eu-repo/semantics/altIdentifier/arxiv/1703.02456","info:eu-repo/grantAgreement/EC/PL 595/2-1"],"date":["2019"]},"external_id":{"arxiv":[]}}]