A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices
DOI10.4208/cicp.OA-2018-0053MaRDI QIDQ5161375
Dorothee Richters, Andrea Walther, Michael Lass, Christian Plessl, Thomas D. Kühne
Publication date: 29 October 2021
Published in: Communications in Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.02456
symmetric positive definite matricesorder of convergenceiteration functionmatrix \(p\)-th rootNewton-SchulzAltman hyperpower method
Computational methods for sparse matrices (65F50) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Orthogonalization in numerical linear algebra (65F25) Numerical computation of matrix exponential and similar matrix functions (65F60)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An optimum cubically convergent iterative method of inverting a linear bounded operator in Hilbert space
- On Newton's method and Halley's method for the principal \(p\)th root of a matrix
- A faster, more stable method for comuting the pth roots of positive definite matrices
- Algorithms for the matrix \(p\)th root
- On the m-th roots of a complex matrix
- Computing matrix functions
- On the Newton Method for the Matrix Pth Root
- A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
- On the Computation of the Matrixk-th Root
- A Schur Algorithm for Computing Matrix pth Roots
- A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
- Functions of Matrices
- A Note on an Iterative Method for Generalized Inversion of Matrices
- On the Inversion of Matrices and Linear Operators
This page was built for publication: A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices
