<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
<PublisherName>OICC Press</PublisherName>
<JournalTitle>International Journal of Mathematical Modelling &amp; Computations</JournalTitle>
<Issn>2228-6233</Issn>
<Volume>5</Volume>
<Issue>1</Issue>
<PubDate PubStatus="epublish">
<Year>2015</Year>
<Month>03</Month>
<Day>21</Day>
</PubDate>
</Journal>
<ArticleTitle>A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT</ArticleTitle>
<VernacularTitle></VernacularTitle>
<FirstPage>69</FirstPage>
<LastPage>79</LastPage>
<ELocationID EIdType="doi"></ELocationID>
<Language>EN</Language>
<AuthorList>
<Author>
<FirstName>Amir</FirstName>
<LastName>Sadeghi</LastName>
<Affiliation>Young Researcher Club, Shahre-rey branch, Islamic Azad university, Tehran, Iran.	
Iran, Islamic Republic of</Affiliation>
<Identifier Source="ORCID"></Identifier>
</Author>
</AuthorList>
<PublicationType>Journal Article</PublicationType>
<History>
<PubDate PubStatus="received">
<Year>2015</Year>
<Month>03</Month>
<Day>21</Day>
</PubDate>
</History>
<Abstract>The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iterations havepoor convergence and stability properties. In this work, a stable recursive techniqueto evaluate an inverse pth root of a given matrix is presented. The scheme is analyzedand its properties are investigated. Computational experiments are also performedto illustrate the strengths and weaknesses of the proposed method.</Abstract>
</Article>
</ArticleSet>