Abstract
In Section 5 Chapter II, we describe how to compute the Hensel code H(p, r, 1/α if we are given H(p, r, α), by using the fast iterative method based on Newton’s method. It is well known that Newton’s method for finding the reciprocal of a real number can be generalized to
-
(i)
the computation of the inverse of a nonsingular matrix (see, for example, Stoer and Bulirsch [1980], p. 310, where this is called Schultz’s method), and
-
(ii)
the computation of the Moore-Penrose g-inverse of an arbitrary matrix (see, for example, Ben-Israel and Greville [1974], p. 300).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Gregory, R.T., Krishnamurthy, E.V. (1984). Iterative Matrix Inversion and the Iterative Solution of Linear Equations. In: Methods and Applications of Error-Free Computation. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5242-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5242-9_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9754-3
Online ISBN: 978-1-4612-5242-9
eBook Packages: Springer Book Archive