ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
LU based algorithms for characteristic polynomial over a finite field
Full text PdfPdf (372 KB)
Source ACM SIGSAM Bulletin archive
Volume 37 ,  Issue 3  (September 2003) table of contents
SPECIAL SECTION: Posters abstracts from ISAAC 2003 table of contents
Pages: 83 - 84  
Year of Publication: 2003
ISSN:0163-5824
Authors
Clément Pernet  LMC-IMAG, Grenoble, France
Zhendong Wan  University of Delaware, Newark, Delaware
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 27,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/990353.990367
What is a DOI?

ABSTRACT

Linear algebra computation over finite fields is important because many symbolic computation problems directly or indirectly rely on linear algebra using efficient finite fields representation.


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
Jean Guillaume Dumas , Thierry Gautier , Clément Pernet, Finite field linear algebra subroutines, Proceedings of the 2002 international symposium on Symbolic and algebraic computation, p.63-74, July 07-10, 2002, Lille, France  [doi>10.1145/780506.780515]
 
2
O. H. Ibarra, S. Moran, and R. Hui. A generalization of the fast LUP matrix decomposition algorithm and applications. Journal of Algorithms, 3(1):45--56, Mar. 1982.
 
3
Walter Keller-Gehrig, Fast algorithms for the characteristic polynomial, Theoretical Computer Science, v.36 n.2-3, p.309-317, June 1985
 
4
C. Pernet. Finite field linear algebra (subroutine-package), 2003. www-lmc, imag. fr/Jean-Guillaume. Dumas/FFLAS.

CITED BY
Jean-Guillaume Dumas , Clément Pernet , Zhendong Wan, Efficient computation of the characteristic polynomial, Proceedings of the 2005 international symposium on Symbolic and algebraic computation, p.140-147, July 24-27, 2005, Beijing, China
Collaborative Colleagues:
Clément Pernet: colleagues
Zhendong Wan: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player