Journal Publications

N. H. Bshouty, R. Cleve, and W. Eberly
Size-Depth Tradeoffs for Algebraic Formulas
SIAM Journal on Computing 24 (1995), pp. 682–705
Please send me email to obtain a copy of this paper.
L. Chen, W. Eberly, E. Kaltofen, B. D. Saunders, W. J. Turner, and G. Villard
Efficient Matrix Preconditioners for Black Box Linear Algebra
Linear Algebra and Its Applications 343–344 (2002); pp. 119–146
This paper is available online at ScienceDirect.
W. Eberly
Decomposition of Algebras over Finite Fields and Number Fields
Computational Complexity 1 (1991), pp. 183–210
Please send me email to obtain a copy of this paper.
W. Eberly
Decomposition of Algebras over R and C
Computational Complexity 1 (1991), pp. 211–234
Please send me email to obtain a copy of this paper.
W. Eberly
Logarithmic Depth Circuits for Hermite Interpolation
Journal of Algorithms 16 (1994), pp. 335–360
This paper is available online at ScienceDirect.
W. Eberly
Very Fast Parallel Band Matrix Arithmetic
Information and Computation 116 (1995), pp. 117–127
This paper is available online at ScienceDirect.
W. Eberly
Very Fast Parallel Polynomial Arithmetic
SIAM Journal on Computing 18 (1989), pp. 955–976
Please send me email to obtain a copy of this paper.
W. Eberly and M. Giesbrecht
Efficient Decomposition of Associative Algebras over Finite Fields
Journal of Symbolic Computation 29 (2000), pp. 441–458
This paper is available online at ScienceDirect.
W. Eberly and M. Giesbrecht
Efficient Decomposition of Separable Algebras
Journal of Symbolic Computation 37 (2004), pp. 35–81
This paper is available online at ScienceDirect.

Conference Publications

N. H. Bshouty, R. Cleve, and W. Eberly
Size-Depth Tradeoffs for Algebraic Formulae
Proceedings, 32nd Annual Symposium on Foundations of Computer Science
San Juan, Puerto Rico, 1991; pp. 334–341
W. Eberly
Black Box Frobenius Decompositions over Small Fields
Proceedings, 2000 International Symposium on Symbolic and Algebraic Computation
St. Andrews, Scotland, 2000; pp. 106–113
W. Eberly
Early Termination over Small Fields
© ACM, 2003

This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for distribution. The definitive version was published in Proceedings, 2003 International Symposium on Symbolic and Algebraic Computation, Philadelphia, Pennsylvania, 2003, pp. 80 87; http://doi.acm.org/10.1145/860854.860882 .
W. Eberly
Efficient Parallel Computations for Singular Band Matrices
Proceedings, 6th ACM-SIAM Symposium on Discrete Algorithms
San Francisco, California, 1995; pp. 132–138
W. Eberly
Efficient Parallel Independent Subsets and Matrix Factorizations
Proceedings, 3rd IEEE Symposium on Parallel and Distributed Processing
Dallas, Texas, 1991; pp. 204–211
W. Eberly
On Efficient Band Matrix Arithmetic
Proceedings, 33rd Foundation on Foundations of Computer Science
Pittsburg, Pennsylvania, 1992; pp. 457–463
W. Eberly
Processor-Efficient Parallel Matrix Inversion over Abstract Fields: Two Extensions
Proceedings, 2nd International Symposium on Parallel Symbolic Computation
Maui, Hawaii, 1997; pp. 38–45
W. Eberly
Reliable Krylov-Based Algorithms for Matrix Null Space and Rank
© ACM, 2004

This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for distribution. The definitive version was published in Proceedings, 2004 International Symposium on Symbolic and Algebraic Computation, Santander, Spain, 2004, pp. 127–134; http://doi.acm.org/10.1145/1005285.1005305 .
W. Eberly
Very Fast Parallel Matrix and Polynomial Arithmetic
Proceedings, 25th Annual Symposium on Foundations of Computer Science
Springer Island, Florida, 1984; pp. 21–30
W. Eberly and M. Giesbrecht
Efficient Decomposition of Associative Algebras
Proceedings, 1996 International Symposium on Symbolic and Algebraic Computation
Zurich, Switzerland, 1996; pp. 170–178
(Preliminary Report)
W. Eberly, M. Giesbrecht, and G. Villard
On Computing the Determinant and Smith Form of an Integer Matrix
Proceedings, 41st Annual Symposium on Foundations of Computer Science
Redondo Beach, California, 2000; pp. 675–685
W. Eberly, L. Higham, and J. Warpechowska-Gruca
Long-Lived, Fast Waitfree Renaming with Optimal Name Space and High Throughput
Proceedings, 12th International Symposium in Distributed Computing, DISC '98
Lecture Notes in Computer Science 1499
Andros, Greece, 1998; pp. 149–160
W. Eberly and E. Kaltofen
On Randomized Lanczos Algorithms
Proceedings, 1997 International Symposium on Symbolic and Algebraic Computation
Maui, Hawaii, 1997; pp. 176–183
Longer Version, Including Proofs: [ Postscript ] [ PDF ]

Other Reports

W. Eberly
Asymptotically Efficient Algorithms for the Frobenius Form
Department of Computer Science, University of Calgary
Technical Report, 2000
Technical Report: [ Postscript ] [ PDF ]
W. Eberly
Computations for Algebras and Group Representations
Technical Report 225/89, Department of Computer Science, University of Toronto, 1989
PhD Thesis: [ Postscript ] [ PDF ]
W. Eberly
Early Termination over Small Fields
Department of Computer Science, University of Calgary
Technical Report 2003–723–26, May, 2003
Technical Report: [ Postscript ] [ PDF ]
W. Eberly
Reliable Krylov-Based Algorithms for Matrix Null Space and Rank
Department of Computer Science, University of Calgary
Technical Report 2004–749–14, February, 2004
Technical Report: [ Postscript ] [ PDF ]
W. Eberly and B. Hovinen
Bounding Nullities of Random Block Hankel Matrices: An Alternative Approach
Department of Computer Science, University of Calgary
Technical Report 2005–779–10, May, 2005
Technical Report: [ PDF ]

Work in Progress

W. Eberly
Yet Another Block Lanczos Algorithm: How to Simplify the Computation and Reduce Reliance on Preconditioners in the Small Field Case

The current version provides proofs of claims that appeared in the original version of my ISSAC 2010 submission. The short paper that ultimately appeared in the conference proceedings included a slightly different algorithm (that reduces the number of matrix-vector products used). I am currently revising proofs in this longer version in order to make it more consistent with the final version of the paper presented at ISSAC and to improve the organization and the quality of writing. I am hopeful that this will be complete near the end of August 2010.

This page was most recently changed on Monday, July 26, 2010 by Wayne Eberly.