Parallel least-squares solution of general and Toeplitz systems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parallel least-squares solution of general and Toeplitz systems

Full text

Pdf (929 KB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the second annual ACM symposium on Parallel algorithms and architectures table of contents

Island of Crete, Greece

Pages: 244 - 253

Year of Publication: 1990

ISBN:0-89791-370-1

Author

V. Pan

Department of Mathematics and Computer Science, Lehman College, CUNY, Bronx, NY and Department of Computer Science, SUNYA, Albany, NY

Sponsors

IEEE-CS : Computer Society
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
CTI : Computer Technology Inst.
EATCS : European Association for Theoretical Computer Science
Computer Tech Inst. : Computer Technology Institute

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 20, Citation Count: 5

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/97444.97691 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.

	BG	D. Bini , L. Gemignani, On the Euclidean scheme for polynomials having interlaced real zeros, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.254-258, July 02-06, 1990, Island of Crete, Greece [doi>10.1145/97444.97692]
	BA	R. R. Bitmead and B. D. O. Anderson, "Asymptotically Fast Solution of Toeplitz and Related Systems of Linear Equations," Linear Algebra and its Applics., vol. 34, pp. 103-116, 1980.
	BGH	A. Borodin, $. yon zur Gathen, and J. ttopcroft, "Fast P~rallel M~trix and GCD Computation," Information and Control, vol. 52,3, pp. 241-256, 1982.
	CKL-A	J. Chun , T. Kailath , H. Lev-Ari, Fast parallel algorithms for QR and triangular factorization, SIAM Journal on Scientific and Statistical Computing, v.8 n.6, p.899-913, November 1, 1987 [doi>10.1137/0908073]
	Cs	L. Csanky, "Fast Parallel Matrix Inversion Algorithm," SIAM J. on Computing, vol. 5,4, pp. 618-623, 1976.
	FKML	B. Friedlander, M. Morf, T. K~ilath, and L. Ljung, "New Inversion Formulas for Matrices Classified in Terms of their Distances from Toeplitz Matrices," Linear Algebra and its Applics., vol. 27, pp. 31- 60, 1979.
	GL	G. H. Golub, and C. F. van Loan, Matrix Computations, Johns Hopkins Univ. Press, Baltimore, Maryland, 1989.
	GP	Zvi Galil , Victor Pan, Parallel evaluation of the determinant and of the inverse of a matrix, Information Processing Letters, v.30 n.1, p.41-45, January 1989 [doi>10.1016/0020-0190(89)90173-7]
	vzG	Joachim von zur Gathen, Parallel algorithms for algebraic problems, SIAM Journal on Computing, v.13 n.4, p.802-824, Nov. 1984 [doi>10.1137/0213050]
	GSe	I. C. Gohberg and A. A. Semencul, "On the Inversion of Finite Toeplitz Matrices ~nd their Continuous Analogs," Mat. Issled., vol. 2, pp. 201-233 (in Russian), 1972.
	Kai	T. Kailath, "Signal Processing Applications of Some Moment Problems," Proc. AMS Syrup. in Applied Math., vol. 37, pp. 71-100, 1987.
	KKM	T. Kail~th, S.-Y. Kung, and M.Morf, "Displacement Ranks of Matrices and Linear Equations," J. Math. Anal. Appl., vol. 68,2, pp. 395-407, 1979.
	PR	V. Pan and J. Reif, "Some Polynomial and Toeplitz Matrix Computations," Proc. 28th Ann. IEEE Syrup. FOCS, pp. 173-181, 1987.
	P88	V. Pan, "New Effective Methods for Computations with Toeplitz-like Matrices," Technical Report 88-28, Computer Science Dept., SUNY Albany, 1988.
	P89	V. Pan, "Fast and Efficient Parallel Inversion of Toeplitz and Block Toeplitz M~trices," Operator Theory; Advances and Applications, vol. 40, pp. 359-389, 1989.
	P89a	Victor Pan, On some computations with dense structured matrices, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, p.34-42, July 17-19, 1989, Portland, Oregon, United States [doi>10.1145/74540.74546]
	PS	F. P. Preparata and D. V. Sarwate, An improved parallel processor bound in fast matrix inversion, Inform. Proc. Lett. vol. 7 (3)(1978) 148-150.
	Sc	A. SchSnhage, "The Fundamental Theorem of Algebr~ in Terms of Computational Complexity," manuscript, Dept. of Math., University of Tiibingen, T/ibingen, West Germany, 1982.
	T64	W. F. Trench, "An Algorithm for Inversion of Finite Toeplitz Matrices," J. of SLAM, vol. 12,3, pp. 515-522, 1964.

CITED BY 5

	Robert M. Corless , Mark W. Giesbrecht , David J. Jeffrey, Approximate polynomial decomposition, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, p.213-219, July 28-31, 1999, Vancouver, British Columbia, Canada
	Victor Y. Pan, Faster solution of the key equation for decoding BCH error-correcting codes, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.168-175, May 04-06, 1997, El Paso, Texas, United States
	V. Y. Pan, Concurrent Iterative Algorithm for Toeplitz-like Linear Systems, IEEE Transactions on Parallel and Distributed Systems, v.4 n.5, p.592-600, May 1993
	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
	Dario Bini , Victor Pan, Parallel complexity of tridiagonal symmetric Eigenvalue problem, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.384-393, January 28-30, 1991, San Francisco, California, United States