Approximation of the pth roots of a matrix by using trapezoid rule
Approximation of the \(p\)th roots of a matrix by using trapezoid rule
Summary: The computation of the roots of positive definite matrices arises in nuclear magnetic resonance, control theory, lattice quantum chromo-dynamics (QCD), and several other areas of applications. The Cauchy integral theorem which arises in complex analysis can be used for computing \(f(A)\), in particular the roots of \(A\), where \(A\) is a square matrix. The Cauchy integral can be approximated by using the trapezoid rule. In this paper, we aim to give a brief overview of the computation of roots of positive definite matrices by employing integral representation. Some numerical experiments are given to illustrate the theoretical results.
- A binary powering Schur algorithm for computing primary matrix roots
- A Schur Algorithm for Computing Matrix pth Roots
- scientific article; zbMATH DE number 1821102 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 2222870 (Why is no real title available?)
This page was built for publication: Approximation of the \(p\)th roots of a matrix by using trapezoid rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417264)