A Numerical Method for Computing the Principal Square Root of a Matrix

<table>The comparison of different methods for finding <svg height="12.8228pt" id="M234" style="vertical-align:-0.04979992pt" version="1.1" viewbox="-0.0498162 -12.773 23.5133 12.8228" width="23.5133pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M686 28C612 35 607 44 591 112C563 234 541 360 519 489L489 666L457 658L147 121C100 40 89 36 24 28L17 0H240L250 28C168 34 159 41 190 101L262 237H482C495 180 503 137 510 91C517 47 514 35 441 28L433 0H677L686 28ZM475 280H285L429 541H431L475 280Z" id="g113-66"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="703" vert-adv-y="703"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,9.52,-5.984)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z" id="g50-50"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,14.139,-5.984)"><path d="M381 704H317L48 -163H112L381 704Z" id="g50-48"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="429" vert-adv-y="429"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,18.211,-5.984)"><path d="M414 144C384 79 371 75 317 75H135L276 221C367 316 408 376 408 465C408 570 327 635 237 635C179 635 131 609 100 575L42 494L67 471C94 510 138 565 205 565C277 565 321 517 321 435C321 348 258 270 195 195C146 137 88 81 33 26V0H411C423 44 433 88 446 135L414 144Z" id="g50-51"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg> in Example <a href="https://static.hindawi.com/articles/aaa/volume-2014/525087/figures/#ex3.2">8</a>.</table>

Abstract and Applied Analysis

fig1

Figure 1

Figure 1: A Numerical Method for Computing the Principal Square Root of a Matrix 