Processor-efficient parallel matrix inversion over abstract fields

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Processor-efficient parallel matrix inversion over abstract fields: two extensions

Full text

Pdf (1.06 MB)

Source

International Symposium on Parallel Symbolic Computation archive
Proceedings of the second international symposium on Parallel symbolic computation table of contents

Maui, Hawaii, United States

Pages: 38 - 45

Year of Publication: 1997

ISBN:0-89791-951-3

Author

Wayne Eberly

Department of Computer Science, University of Calgary, Calgary, Alberta, Canada, T2N 1N4

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 13, Downloads (12 Months): 32, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/266670.266684 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BAUa, W., AND STRASSEN, V. The complexity of partial derivatives. Theoretical Computer Science 22 (1982), 317-330.
	2	BRENT, R. P., GUSTAVSON, F. G., AND YUN, D. Y. Y. Fast solution of Toeplitz systems of equations and computation of Padd approximants. Journal of Algorithms I (1980), 259-295.
	3	EBERLY, W. Efficient parallel independent subsets and matrix factorizations. In Proceedings, 3rd IEEE Symposium on Parallel and Distributed Processing (Dallas, USA, 1991), pp. 204-211.
	4	Mark Giesbrecht, Nearly Optimal Algorithms For Canonical Matrix Forms, SIAM Journal on Computing, v.24 n.5, p.948-969, Oct. 1995 [doi>10.1137/S0097539793252687]
	5	GOHBERG, I. C., AND SEMENCUL, A. A. On the inversion of finite Toeplitz matrices and their continuous analogs. Mat. Issled. 2 (1972), 201-233. In Russian.
	6	Erich Kaltofen , Victor Pan, Processor efficient parallel solution of linear systems over an abstract field, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.180-191, July 21-24, 1991, Hilton Head, South Carolina, United States [doi>10.1145/113379.113396]
	7	KALTOFEN, E., ANt) PAN, V. Processor-efficient par- Mlel solution of linear systems II: The general case. In Proceedings, 33rd IEEE Symposium on Foundations of Computer Science (Pittsburgh, USA, 1992), pp. 714- 723.
	8	KALTOFEN, F,., AND PAN, V. Parallel solution of Toeplitz and Toeplitz-like linear systems over fields of small positive characteristic. In Proceedings, PASCO '9~: First International Symposium on Parallel Symbolic Computation (1994), World Scientific Publishing, pp. 225-233.
	9	V. Pan, Complexity of parallel matrix computations, Theoretical Computer Science, v.54 n.1, p.65-85, 1987 [doi>10.1016/0304-3975(87)90019-3]
	10	D H Wiedemann, Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, v.32 n.1, p.54-62, Jan. 1986 [doi>10.1109/TIT.1986.1057137]

CITED BY 2

	Thom Mulders , Arne Storjohann, Diophantine linear system solving, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, p.181-188, July 28-31, 1999, Vancouver, British Columbia, Canada
	Wayne Eberly , Mark Giesbrecht , Pascal Giorgi , Arne Storjohann , Gilles Villard, Faster inversion and other black box matrix computations using efficient block projections, Proceedings of the 2007 international symposium on Symbolic and algebraic computation, July 29-August 01, 2007, Waterloo, Ontario, Canada