ACM Home Page
Please provide us with feedback. Feedback
Efficient algorithms for Hankel matrices over Z[x1,…,xr]
Full text PdfPdf (545 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: 201 - 208  
Year of Publication: 1993
ISBN:0-89791-604-2
Authors
Sponsor
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 10,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/164081.164125
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
Brent R.P., Gustavson F.G., and Yun D.Y.Y., " Fast Solution of Toeplitz system of equations and computation of Padd approximants', J. Algorithms 1 (1980), pp. 259-295.
2
 
3
4
 
5
Gantmacher F.R., "Theory of Matrices", Chelsea New York (1960).
 
6
Heinig G., Rost K. "Algebraic Methods for Toeplitz-like Matrices and Operators", Birkh~iuser Verlag (1984).
 
7
Llovet J., Sendra J.R. "Hankel Matrices and Polynomials", Lectures Notes in Computer Science 356 (Springer Verlag 1989) pp 321- 333.
8
 
9

Collaborative Colleagues:
Juan R. Sendra: colleagues
Juan Llovet: colleagues