Parallel computations with Toeplitz-like and Hankel-like matrices

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parallel computations with Toeplitz-like and Hankel-like matrices

Full text

Pdf (745 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1993 international symposium on Symbolic and algebraic computation table of contents

Kiev, Ukraine

Pages: 193 - 200

Year of Publication: 1993

ISBN:0-89791-604-2

Authors

Dario Bini
Victor Pan

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 17, Citation Count: 0

Additional Information:

references 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/164081.164124 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	D. Bini, M. Capovani, Spectral and Computational Properties of Band Symmetric Toeplitz Matrices, L/n. Alg. and its Applics., 52/53, 99- 126, 1983.
	2	D. Bini, On a Class of Matrices Related to Toeplitz Matrices, Tech. Rep. TR 83-5, Computer Sci. Dept, SUNYA, Albany, NY, 1983.
	3	D. Bini, V. Pan, Numerical and Algebraic Computations with Matrices and Polynomials, Birkhauser, Boston, 1993.
	4	D. Bini, V. Pan, Improved Parallel Computations with Toeplitz-like and Hankel-like Matrices, to appear in Linear Algebra and Its Applications.
	5	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]
	6	J. }a Ja, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, t992.
	7	T. Kailath, S.-Y. Kung, M. Morf, Displacement Rank of Matrices and Linear Equations, Math. Anal. Applics., 68, 2,395-407, 1979.
	8	Richard M. Karp , Vijaya Ramachandran, Parallel algorithms for shared-memory machines, Handbook of theoretical computer science (vol. A): algorithms and complexity, MIT Press, Cambridge, MA, 1991
	9	F. Thomson Leighton, Introduction to parallel algorithms and architectures: array, trees, hypercubes, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991
	10	V. Pan, On Computations with Dense Structured Matrices, Math. of Computation, 55, 191,179-190, 1990.
	11	V. Pan, Parametrization of Newton's Iteration for Computations with Structured Matrices and Applications, Computers 8j Math. (with Applics.), 24, 3, 61-75, 1992.
	12	Victor Y. Pan , Franco P. Preparata, Supereffective slow-down of parallel computations, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.402-409, June 29-July 01, 1992, San Diego, California, United States [doi>10.1145/140901.141926]
	13	W. It. Press, B. P. Flannery, S. A. Teukolsky, W. T. Vetterling, Numerical Recipes, Cambridge University Press, Cambridge 1986.