Wayne Eberly

Generating author description...

All published works

Action	Title	Year	Authors
+	Selecting Algorithms for Black Box Matrices: Checking for Matrix Properties That Can Simplify Computations	2016	Wayne Eberly
+	Black Box Linear Algebra: Extending Wiedemann's Analysis of a Sparse Matrix Preconditioner for Computations over Small Fields	2016	Wayne Eberly
+	Selecting Algorithms for Black Box Matrices: Checking for Matrix Properties That Can Simplify Computations	2016	Wayne Eberly
+ PDF Chat	Faster inversion and other black box matrix computations using efficient block projections	2007	Wayne Eberly Mark Giesbrecht Pascal Giorgi Arne Storjohann Gilles Villard
+	Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections	2007	Wayne Eberly Mark Giesbrecht Pascal Giorgi Arne Storjohann Gilles Villard
+	Solving sparse rational linear systems	2006	Wayne Eberly Mark Giesbrecht Pascal Giorgi Arne Storjohann Gilles Villard
+ PDF Chat	Solving Sparse Integer Linear Systems	2006	Wayne Eberly Mark Giesbrecht Pascal Giorgi Arne Storjohann Gilles Villard
+	Solving Sparse Integer Linear Systems	2006	Wayne Eberly Mark Giesbrecht Pascal Giorgi Arne Storjohann Gilles Villard
+	Bounding the Nullities of Random Block Hankel Matrices: An Alternative Approach	2005	Wayne Eberly Bradford Hovinen
+	Reliable Krylov-based algorithms for matrix null space and rank	2004	Wayne Eberly
+	Asymptotically Efficient Algorithms for the Frobenius Form	2002	Wayne Eberly
+	Efficient Decomposition of Associative Algebras over Finite Fields	2000	Wayne Eberly Mark Giesbrecht
+	Processor-efficient parallel matrix inversion over abstract fields	1997	Wayne Eberly
+	Efficient decomposition of associative algebras	1996	Wayne Eberly Mark Giesbrecht
+	Size-Depth Tradeoffs for Algebraic Formulas	1995	Nader H. Bshouty Richard Cleve Wayne Eberly
+	Decompositions of algebras over ? and ?	1991	Wayne Eberly
+	Computations for algebras and group representations	1989	Wayne Eberly Joachim von zur Gathen

Common Coauthors

Coauthor	Papers Together
Mark Giesbrecht	7
Arne Storjohann	5
Pascal Giorgi	5
Gilles Villard	5
Joachim von zur Gathen	1
Nader H. Bshouty	1
Bradford Hovinen	1
Richard Cleve	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems	1995	Erich Kaltofen	5
+	Matrix multiplication via arithmetic progressions	1990	Don Coppersmith S. Winograd	5
+ PDF Chat	LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA	2002	Jean‐Guillaume Dumas Thierry Gautier Mark Giesbrecht Pascal Giorgi Bradford Hovinen Erich Kaltofen B. David Saunders William J. Turner Gilles Villard	4
+	Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm	1994	Don Coppersmith	4
+ PDF Chat	The Inverses of Block Hankel and Block Toeplitz Matrices	1990	George Labahn Dong Koo Choi Stan Cabay	3
+	Algorithmic properties of maximal orders in simple algebras over Q	1992	Lajos R�nyai	3
+	Factoring Polynomials over Algebraic Number Fields	1985	Susan Landau	3
+	Efficient parallel solution of sparse systems of linear diophantine equations	1997	Mark Giesbrecht	3
+	Exact solution of linear equations usingP-adic expansions	1982	John D. Dixon	3
+	On fast multiplication of polynomials over arbitrary algebras	1991	David G. Cantor Erich Kaltofen	3
+	Approximate algorithms to derive exact solutions to systems of linear equations	1979	Robert T. Moenck John H. Carter	2
+	Simple algebras are difficult	1987	Lajos Rónyai	2
+	A p-adic algorithm for univariate partial fractions	1981	Paul S. Wang	2
+	Computing in Algebraic Extensions	1982	Rüdiger Loos	2
+ PDF Chat	An Exact Method for Finding the Roots of a Complex Polynomial	1976	James R. Pinkert	2
+	Some problems in computational representation theory	1990	Gerhard O. Michler	2
+	New Methods for Reduction of Group Representations Using an Extension of Schur's Lemma	1964	John R. Gabriel	2
+	Computing the structure of finite algebras	1990	Lajos Rónyai	2
+	An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)	1946	T. A. A. B.	2
+ PDF Chat	Certified dense linear system solving	2003	Thom Mulders Arne Storjohann	2
+	A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants	1994	Bernhard Beckermann George Labahn	2
+ PDF Chat	Testing modules for irreducibility	1994	Derek F. Holt Sarah Rees	2
+ PDF Chat	On Hypercomplex Numbers	1908	J. H. M. Wedderburn	2
+	Fast solution of toeplitz systems of equations and computation of Padé approximants	1980	Richard P. Brent Fred G. Gustavson David Y. Y. Yun	2
+	Diophantine linear system solving	1999	Thom Mulders Arne Storjohann	2
+	Computational complexity of real functions	1982	Ker‐I Ko Harvey M. Friedman	1
+	Scalar polynomial equations for matrices over a finite field	1958	John H. Hodges	1
+	Zero divisors in quaternion algebras	1988	Lajos Rónyai	1
+	Solving sparse rational linear systems	2006	Wayne Eberly Mark Giesbrecht Pascal Giorgi Arne Storjohann Gilles Villard	1
+	Recognizing primes in random polynomial time	1987	Leonard M. Adleman Ming-Deh A. Huang	1
+	High speed computation of group characters	1967	John D. Dixon	1
+	Integer Smith form via the valence	2000	Jean‐Guillaume Dumas B. David Saunders Gilles Villard	1
+	An Introduction to the Theory of Numbers.	1961	W. J. LeVeque Ivan Niven Herbert S. Zuckerman	1
+	Size-depth tradeoff in non-monotone Boolean formulae	1980	Beate Commentz-Walter Juergen Sattler	1
+	Processor-efficient parallel matrix inversion over abstract fields	1997	Wayne Eberly	1
+	A New Algorithm for the Computation of Canonical Forms of Matrices over Fields	1997	Allan Steel	1
+ PDF Chat	An introduction to the theory of numbers	1960	G. H. Hardy	1
+	Fast algorithms under the extended riemann hypothesis	1982	Eric Bach	1
+	On the computation of minimal polynomials	1986	David R. Richman	1
+	Group characters and algebra	1934	D. E. Littlewood A. R. Richardson	1
+	<i>Linear Groups with an Exposition of the Galois Field Theory</i>	1959	L. E. Dickson J. Gillis	1
+	A transpose-free “Lanczos/Orthodir” algorithm for linear systems	1997	Claude Brezinski	1
+	Factoring integers with the number field sieve	1993	Joe Buhler H. W. Lenstra Carl Pomerance	1
+	An <i>O</i> ( <i>n</i> <sup>3</sup> ) algorithm for the Frobenius normal form	1998	Arne Storjohann	1
+	Arithmetic in Basic Algebraic Domains	1983	George E. Collins Max Mignotte Franz Winkler	1
+	Improved algorithms for computing determinants and resultants	2004	Ioannis Z. Emiris Victor Y. Pan	1
+	Solution of systems of linear equations by minimized iterations	1952	Cornelius Lanczos	1
+	An iteration method for the solution of the eigenvalue problem of linear differential and integral operators	1950	Cornelius Lanczos	1
+	A note on the algebra of S-functions	1949	John A. Todd	1
+	Multiplying Schur functions	1984	Jeffrey B. Remmel R Whitney	1