• Home
  • Search
  • Efficient iterative algorithms for bounding the inverse of a matrix
  • Cite Icon9
  • https://doi.org/10.1007/bf02262219Copy DOI Icon

Efficient iterative algorithms for bounding the inverse of a matrix

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper we are considering iterative methods for bounding the inverse of a matrix, which make use of interval arithmetic. We present a class of methods as a combination of ordinary Schulz's methods for only approximating the inverse matrix (see [3]) and of well-known interval Schulz's methods (see [1]). Two convergence theorems are proved. Our methods are shown to be asymptotically of the same order of convergence as the ordinary Schulz's methods being part of them. Therefore we are getting considerably more efficient interval methods by our approach than by the classical interval Schulz's methods in [1] or [5]. A numerical example is given.

Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.