A. Bo.jaficzyk, Complexity of solving linear systems in different models ofcomputation. SIAMJ. numer. Analysis 21(3), 591-603 (1984). Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Fast and Efficient Parallel Solution of Dense Linear Systems - Pan, Reif (1989) (2 citations) (Correct)
....time and significantly decreases the known processor bounds. The iterative methods that we describe in Sections 2 and 4 are known ones, namely, Newton s iteration and its extensions. The first use of Newton s iteration in order to invert a matrix is attributed by Householder to [22] compare also [23 30] for more recent descriptions and study of such methods) To make Newton s method work for matrix inversion, an initial approximateinverse B of a given matfix ,4 is required such that III BAII is substantially less than 1 where I is the identity matrix. Now we arrive at the problem of ....
A. Bo.jaficzyk, Complexity of solving linear systems in different models ofcomputation. SIAMJ. numer. Analysis 21(3), 591-603 (1984).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC