@Article{CiCP-25-2,
author = {},
title = {A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices},
journal = {Communications in Computational Physics},
year = {2019},
volume = {25},
number = {2},
pages = {564--585},
abstract = {<p style="text-align: justify;">We address the general mathematical problem of computing the inverse
p-th root of a given matrix in an efficient way. A new method to construct iteration
functions that allow calculating arbitrary p-th roots and their inverses of symmetric
positive definite matrices is presented. We show that the order of convergence is at
least quadratic and that adjusting a parameter q leads to an even faster convergence.
In this way, a better performance than with previously known iteration schemes is
achieved. The efficiency of the iterative functions is demonstrated for various matrices
with different densities, condition numbers and spectral radii.</p>},
issn = {1991-7120},
doi = {https://doi.org/10.4208/cicp.OA-2018-0053},
url = {https://global-sci.com/article/79905/a-general-algorithm-to-calculate-the-inverse-principal-p-th-root-of-symmetric-positive-definite-matrices}
}