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
Abstract. Stable versions of Newton’s iteration for computing the principal matrix pth root A1/p of ...
In Markov chain models in finance and healthcare a transition matrix over a certain time interval is...
WOS: A1997YG10800015An iterative algorithm for computing the principal nth root of a positive-defini...
AbstractAn accelerated, more stable generalization of Newton's method for finding matrix pth roots i...
AbstractAn accelerated, more stable generalization of Newton's method for finding matrix pth roots i...
New theoretical results are presented about the principal matrix pth root. In particular, we show th...
AbstractIn Markov chain models in finance and healthcare a transition matrix over a certain time int...
Any nonsingular matrix has pth roots. One way to compute matrix pth roots is via a specialized versi...
Having origins in the increasingly popular Matrix Theory, the square root function of a matrix has r...
AbstractIf A is a matrix with no negative real eigenvalues and all zero eigenvalues of A are semisim...
AbstractAn efficient closed form to compute the square root of a 3 × 3 positive definite matrix is p...
Having origins in the increasingly popular Matrix Theory, the square root function of a matrix has r...
Abstract. Newton’s method for the inverse matrix pth root, A−1/p, has the attraction that it involve...
AbstractIn Markov chain models in finance and healthcare a transition matrix over a certain time int...
We discuss different variants of Newton’s method for computing the pth root of a given matrix. A sui...
Abstract. Stable versions of Newton’s iteration for computing the principal matrix pth root A1/p of ...
In Markov chain models in finance and healthcare a transition matrix over a certain time interval is...
WOS: A1997YG10800015An iterative algorithm for computing the principal nth root of a positive-defini...
AbstractAn accelerated, more stable generalization of Newton's method for finding matrix pth roots i...
AbstractAn accelerated, more stable generalization of Newton's method for finding matrix pth roots i...
New theoretical results are presented about the principal matrix pth root. In particular, we show th...
AbstractIn Markov chain models in finance and healthcare a transition matrix over a certain time int...
Any nonsingular matrix has pth roots. One way to compute matrix pth roots is via a specialized versi...
Having origins in the increasingly popular Matrix Theory, the square root function of a matrix has r...
AbstractIf A is a matrix with no negative real eigenvalues and all zero eigenvalues of A are semisim...
AbstractAn efficient closed form to compute the square root of a 3 × 3 positive definite matrix is p...
Having origins in the increasingly popular Matrix Theory, the square root function of a matrix has r...
Abstract. Newton’s method for the inverse matrix pth root, A−1/p, has the attraction that it involve...
AbstractIn Markov chain models in finance and healthcare a transition matrix over a certain time int...
We discuss different variants of Newton’s method for computing the pth root of a given matrix. A sui...
Abstract. Stable versions of Newton’s iteration for computing the principal matrix pth root A1/p of ...
In Markov chain models in finance and healthcare a transition matrix over a certain time interval is...
WOS: A1997YG10800015An iterative algorithm for computing the principal nth root of a positive-defini...