Author:
Petkoviá M. S.,Herzberger J.
Abstract
AbstractA family of efficient methods of Schulz‐type for bounding the inverse matrix has been proposed in the recent paper [7]. This family depends on two parameters concerning the orders of convergence of the applied iterative methods in floating‐point arithmetic as well as in interval arithmetic. In this paper we find optimal values of these parameters with respect to the efficiency index that provide the construction of the most efficient algorithm from the considered family of combined methods.
Subject
Applied Mathematics,Computational Mechanics
Reference10 articles.
1. Matrizeninvertierung mit Fehlererfassung;Alefeld G.;Elektron. Datenverarb.,1970
2. On the R-order of some recurrences with applications to inclusion-methods II
3. A class of optimal iterative methods of inverting a linear bounded operator
4. Monotone Einschliessungsalgorithmen für die inverse Matrix mit Hilfe von PASCAL‐SC;Herzberger J.;Angew. Informatik,1988