Fast and Efficient Parallel Solution of Dense Linear Systems

@inproceedings{Cuny1989FastAE,
  title={Fast and Efficient Parallel Solution of Dense Linear Systems},
  author={B. Cuny and n{\'y}},
  year={1989}
}
The most efficient previously known parallel algorithms for the inversion ofa nonsingular n x n matrix A or solving a linear system Ax = b over the rational numbers require O(log2n) time and M(n).~ processors [provided that M(n) processors suffice in order to multiply two n × n rational matrices in time O (log n)]. Furthermore, the known polylog arithmetic time algorithms for those problems are numerically unstable. In this paper we apply Newton's iteration and initially choose an approximate… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS
18 Citations
20 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 20 references

A note on iterative method for generalized inversion of matrices

  • A. Ben-Israel
  • Math . Comput .
  • 1984

How to Multiply Matrices Faster

  • F. P. Preparata, D. V. Sarwate
  • Lecture Notes in Computer Science
  • 1984

On numerical properties of an iterative method for computing the MoorcPenrose generalized inverse

  • G. W. Stuart
  • SlAM J . numer . Analysis
  • 1984

Similar Papers

Loading similar papers…