4 papers
Black Box Linear Algebra: Extending Wiedemann's Analysis of a Sparse Matrix Preconditioner for Computations over Small Fields
Wayne Eberly
Wiedemann's paper, introducing his algorithm for sparse and structured matrix computations over arbitrary fields, also presented a pair of matrix preconditioners for computations o…
Selecting Algorithms for Black Box Matrices: Checking for Matrix Properties That Can Simplify Computations
Wayne Eberly
Processes to automate the selection of appropriate algorithms for various matrix computations are described. In particular, processes to check for, and certify, various matrix prop…
Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi +2
Block projections have been used, in [Eberly et al. 2006], to obtain an efficient algorithm to find solutions for sparse systems of linear equations. A bound of softO(n^(2.5)) mach…
Solving Sparse Integer Linear Systems
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi +2
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a -adic lifting technique combined with the use of block mat…