See this document in CiteSeerX!

Algorithms for Similarity Transforms (Extended Abstract) (1999)  (Make Corrections)  (3 citations)
Arne Storjohann, Gilles Villard



  Home/Search   Context   Related

 
View or download:
enslyon.fr/~gvillard/BIBLI...rwca00.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  enslyon.fr/~gvillard/BI...biblio (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: (Update)


Context of citations to this paper:   More

.... matches the worst case complexity of the best known deterministic algorithmic for this problem, recently given by Storjohann and Villard [17], and that seems to be superior when applied to sparse or structured matrices with a small number of invariant factors. A large eld...

.... matches the worst case complexity of the best known deterministic algorithm for this problem, recently given by Storjohann and Villard [25], and that seems to be superior when applied to sparse or structured matrices with a small number of invariant factors. A version that...

Cited by:   More
Computing the Frobenius Normal Form of a Sparse Matrix - Villard (2000)   (Correct)
Asymptotically Efficient Algorithms for the Frobenius Form - Eberly (2000)   (Correct)
Efficient Computations of Frobenius Forms over Small Fields - Eberly   (Correct)

Active bibliography (related documents):   More   All
0.8:   An O(n³) Algorithm for Frobenius Normal Form - Storjohann (1997)   (Correct)
0.3:   Black Box Frobenius Decompositions over Small Fields (Extended.. - Eberly (2000)   (Correct)
0.3:   Fast modular algorithms for squarefree factorization and Hermite.. - Gerhard (1999)   (Correct)

Similar documents based on text:   More   All
0.4:   Computing Rational Forms of Integer Matrices - Giesbrecht, Storjohann (2000)   (Correct)
0.4:   Nearly Optimal Algorithms For Canonical Matrix Forms - Giesbrecht (1993)   (Correct)
0.3:   On Computing the Determinant and Smith Form of an Integer.. - Eberly, Giesbrecht.. (2000)   (Correct)

Related documents from co-citation:   More   All
5:   Nearly Optimal Algorithms for Canonical Matrix Forms - Giesbrecht - 1993
3:   Solving sparse linear equations over nite elds (context) - Wiedemann - 1986
3:   Processor Ecient Parallel Solution of Linear Systems over an Abstract Field (context) - Kaltofen, Pan - 1991

BibTeX entry:   (Update)

Storjohann, A., and Villard, G. Algorithms for similarity transforms. In Seventh Rhine Workshop on Computer Algebra (Bregenz, Austria, March 1999). http://citeseer.ist.psu.edu/storjohann99algorithms.html   More

@misc{ storjohann99algorithms,
  author = "A. Storjohann and G. Villard",
  title = "Algorithms for similarity transforms",
  text = "Storjohann, A., and Villard, G. Algorithms for similarity transforms. In
    Seventh Rhine Workshop on Computer Algebra (Bregenz, Austria, March 1999).",
  year = "1999",
  url = "citeseer.ist.psu.edu/storjohann99algorithms.html" }
Citations (may not include all citations):
116   Algorithmic Number Theory (context) - Bach, rey - 1996
26   Parallel algorithms for matrix normal forms - Kaltofen, Krishnamoorthy et al. - 1990
19   Calcul Exact Des Formes De Jordan et de Frobenius d'une Matr.. (context) - Ozello - 1987
11   Shifted normal forms of polynomial matrices - Beckermann, Labahn et al. - 1999
7   Linear Algebra and its Applications (context) - Hermite, forms et al. - 1998
7   On Rational Normal Form of Endomorphisms: a Primer to Constr.. (context) - uneburg - 1987
5   A new algorithm for the computation of canonical forms of ma.. (context) - Steel - 1997
4   Fast parallel algorithms for matrix reduction to normal form.. (context) - Villard - 1997
3   Nearly Optimal Algorithms for Canonical Matrix Forms (context) - Giesbrecht - 1993
2   Frobenius form and cyclic vectors (context) - Augot, Camion - 1994
1   Phd Thesis (context) - Storjohann

Documents on the same site (http://www.ens-lyon.fr/~gvillard/BIBLIOGRAPHIE/biblio.html):   More
Computing the Sign Or the Value of the Determinant of an.. - Kaltofen, Villard (2002)   (Correct)
On efficient sparse integer matrix Smith normal form.. - Dumas, Saunders, Villard (2001)   (Correct)
Some Algorithms for Matrix Polynomials - Villard   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC