Learn More
This paper uses successive squaring of a composite matrix to approximate the generalised inverse of an m by n matrix A. For m \approx n, the g-inverse of A can be computed in parallel time ranging from O(log n) to O(log^{2}n). The simple structure of the successive matrix squaring algorithm leads to a straightforward parallel implementation. Test results(More)
  • 1