A one parameter method for the matrix inverse square root

Slobodan Lakić

Applications of Mathematics (1997)

  • Volume: 42, Issue: 6, page 401-410
  • ISSN: 0862-7940

Abstract

top
This paper is motivated by the paper [3], where an iterative method for the computation of a matrix inverse square root was considered. We suggest a generalization of the method in [3]. We give some sufficient conditions for the convergence of this method, and its numerical stabillity property is investigated. Numerical examples showing that sometimes our generalization converges faster than the methods in [3] are presented.

How to cite

top

Lakić, Slobodan. "A one parameter method for the matrix inverse square root." Applications of Mathematics 42.6 (1997): 401-410. <http://eudml.org/doc/32989>.

@article{Lakić1997,
abstract = {This paper is motivated by the paper [3], where an iterative method for the computation of a matrix inverse square root was considered. We suggest a generalization of the method in [3]. We give some sufficient conditions for the convergence of this method, and its numerical stabillity property is investigated. Numerical examples showing that sometimes our generalization converges faster than the methods in [3] are presented.},
author = {Lakić, Slobodan},
journal = {Applications of Mathematics},
keywords = {Newton method; matrix inverse square root; iterative process; inverse square root; iterative process},
language = {eng},
number = {6},
pages = {401-410},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {A one parameter method for the matrix inverse square root},
url = {http://eudml.org/doc/32989},
volume = {42},
year = {1997},
}

TY - JOUR
AU - Lakić, Slobodan
TI - A one parameter method for the matrix inverse square root
JO - Applications of Mathematics
PY - 1997
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 42
IS - 6
SP - 401
EP - 410
AB - This paper is motivated by the paper [3], where an iterative method for the computation of a matrix inverse square root was considered. We suggest a generalization of the method in [3]. We give some sufficient conditions for the convergence of this method, and its numerical stabillity property is investigated. Numerical examples showing that sometimes our generalization converges faster than the methods in [3] are presented.
LA - eng
KW - Newton method; matrix inverse square root; iterative process; inverse square root; iterative process
UR - http://eudml.org/doc/32989
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.