Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

On Wiedemann's Method of Solving Sparse Linear Systems

- E. Kaltofen, B. Saunders
- Mathematics, Computer Science
- AAECC
- 7 October 1991

TLDR

199 20- PDF

LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA

- Jean-Guillaume Dumas, T. Gautier, +6 authors G. Villard
- Computer Science
- 1 July 2002

TLDR

102 8- PDF

Sparse Polynomial Interpolation in Nonstandard Bases

- Y. N. Lakshman, B. Saunders
- Mathematics, Computer Science
- SIAM J. Comput.
- 1 April 1995

In this paper, we consider the problem of interpolating univariate polynomials over a field of characteristic zero that are sparse in (a) the Pochhammer basis or, (b) the Chebyshev basis. The… Expand

55 7- PDF

Fast parallel computation of hermite and smith forms of polynomial matrices

- E. Kaltofen, M. Krishnamoorthy, B. Saunders
- Mathematics
- 1 October 1987

Boolean circuits of polynomial size and polylogarithmic depth are given for computing the Hermite and Smith normal forms of polynomial matrices over finite fields and the field of rational numbers.… Expand

83 5- PDF

Certifying inconsistency of sparse linear systems

- M. Giesbrecht, A. Lobo, B. Saunders
- Mathematics, Computer Science
- SIGS
- 1 September 1997

18 5

Efficient matrix preconditioners for black box linear algebra

- L. Chen, W. Eberly, E. Kaltofen, B. Saunders, William J. Turner, G. Villard
- Mathematics
- 1 March 2002

Abstract The main idea of the “black box” approach in exact linear algebra is to reduce matrix problems to the computation of minimum polynomials. In most cases preconditioning is necessary to obtain… Expand

76 4- PDF

Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms

- Jean-Guillaume Dumas, F. Heckenbach, B. Saunders, V. Welker
- Mathematics, Computer Science
- Algebra, Geometry, and Software Systems
- 2003

TLDR

79 4- PDF

An extension of Liouville's theorem on integration in finite terms

- M. Singer, B. Saunders, B. Caviness
- Mathematics, Computer Science
- SYMSAC '81
- 5 August 1981

TLDR

22 4- PDF

Computing the smith forms of integer matrices and solving related problems

- B. Saunders, Zhendong Wan
- Mathematics
- 2005

The Smith form of an integer matrix plays an important role in the study of algebraic group theory, homology group theory, systems theory, matrix equivalence, Diophantine systems, and control theory.… Expand

17 4- PDF

Parallel algorithms for matrix normal forms

- E. Kaltofen, M. Krishnamoorthy, B. Saunders
- Mathematics
- 15 July 1990

Abstract Here we offer a new randomized parallel algorithm that determines the Smith normal form of a matrix with entries being univariate polynomials with coefficients in an arbitrary field. The… Expand

80 3- PDF