(Created page with "== Abstract == Uno de los métodos numéricos estables más utilizado para calcular la raíz cuadrada de una matriz es el Método de Newton (MN) el cual tiene la desventaja d...")
 
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
 
== Abstract ==
 
== Abstract ==
  
−
Uno de los métodos numéricos estables más utilizado para calcular la raíz cuadrada de una matriz es el Método de Newton (MN) el cual tiene la desventaja de que, em cada iteración, es necesario resolver una ecuación matricial de Sylvester para matrices densas resultando computacionalmente costos. Se han hecho simplificaciones al MN, resultando un par de iteraciones simplificadas. Higham demostró, a través de la teoría de perturbaciones, que éstas son numéricamente inestables. En este artículo se desarrolla una iteración alternativa sinplificada del Método de Newton (IASMN) para calcular la raíz cuadrada de una matriz real simétrica definida positiva, la cual es atractiva por ser convergente, computacionalmente económica y, para propósitos prácticos, es numéricamente estable. Summary One of the numerically stable methods to calculate he Squire root of a matrix is the Newton’s Method, but it has the disadvantage that in each iteration it is necessary to solve a Sylvester’s matrix equation for full matrix, which is computationally expensive. Modifications to the method have been made, resulting a pair of simplified iterations, but it has been proved, through the perturbations theory, that these are numerically unstable. In this article, a simplified alternative iteration of Newton’s Method for the calculation of the square root of a positive definite real matrix is presented, which is attractive for being convergent, computationally economic and, for practical purposes, numerically stable.
+
One of the numerically stable methods to calculate he Squire root of a matrix is the Newton’s Method, but it has the disadvantage that in each iteration it is necessary to solve a Sylvester’s matrix equation for full matrix, which is computationally expensive. Modifications to the method have been made, resulting a pair of simplified iterations, but it has been proved, through the perturbations theory, that these are numerically unstable. In this article, a simplified alternative iteration of Newton’s Method for the calculation of the square root of a positive definite real matrix is presented, which is attractive for being convergent, computationally economic and, for practical purposes, numerically stable.
  
 
== Full document ==
 
== Full document ==
 
<pdf>Media:draft_Content_579135800RR261E.pdf</pdf>
 
<pdf>Media:draft_Content_579135800RR261E.pdf</pdf>

Latest revision as of 11:02, 14 June 2017

Abstract

One of the numerically stable methods to calculate he Squire root of a matrix is the Newton’s Method, but it has the disadvantage that in each iteration it is necessary to solve a Sylvester’s matrix equation for full matrix, which is computationally expensive. Modifications to the method have been made, resulting a pair of simplified iterations, but it has been proved, through the perturbations theory, that these are numerically unstable. In this article, a simplified alternative iteration of Newton’s Method for the calculation of the square root of a positive definite real matrix is presented, which is attractive for being convergent, computationally economic and, for practical purposes, numerically stable.

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document
Back to Top
GET PDF

Document information

Published on 01/01/10
Accepted on 01/01/10
Submitted on 01/01/10

Volume 26, Issue 1, 2010
Licence: CC BY-NC-SA license

Document Score

0

Views 10
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?

I am an author