B. David Saunders

According to our database, B. David Saunders authored at least 46 papers between 1978 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Equivalences for Linearizations of Matrix Polynomials.

Robert M. Corless, Leili Rafiee Sevyeri, B. David Saunders

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020

On Parametric Linear System Solving.

Robert M. Corless, Mark Giesbrecht, Leili Rafiee Sevyeri, B. David Saunders

Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2017

Compiler auto-vectorization of matrix multiplication modulo small primes.

Matthew A. Lambert, B. David Saunders

Proceedings of the International Workshop on Parallel Symbolic Computation, 2017

2016

Probabilistic analysis of block wiedemann for leading invariant factors.

Gavin Harrison, Jeremy Johnson, B. David Saunders

ACM Commun. Comput. Algebra, 2016

2015

Matrices with Two Nonzero Entries per Row.

B. David Saunders

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

3-ranks for strongly regular graphs.

Andrew Novocin, David Saunders, Alexander Stachnik, Bryan S. Youse

Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, 2015

2014

Elements of Design for Containers and Solutions in the LinBox Library.

Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet, B. David Saunders

CoRR, 2014

Elements of Design for Containers and Solutions in the LinBox Library - Extended Abstract.

Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet, B. David Saunders

Proceedings of the Mathematical Software - ICMS 2014, 2014

2013

Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation.

Gavin Harrison, Jeremy Johnson, B. David Saunders

ACM Commun. Comput. Algebra, 2013

2012

Fast computation of Smith forms of sparse matrices over local rings.

Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin, B. David Saunders

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011

Numeric-symbolic exact rational linear system solver.

B. David Saunders, David Harlan Wood, Bryan S. Youse

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Quadratic-time certificates in linear algebra.

Erich L. Kaltofen, Michael Nehring, B. David Saunders

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010

Abstract only: Bitslicing with matrix algorithms oblivious to the data compression.

Bryan S. Youse, B. David Saunders

ACM Commun. Comput. Algebra, 2010

LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation.

Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, B. David Saunders

Proceedings of the Mathematical Software, 2010

2009

Large matrix, small rank.

B. David Saunders, Bryan S. Youse

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

On finding multiplicities of characteristic polynomial factors of black-box matrices.

Jean-Guillaume Dumas, Clément Pernet, B. David Saunders

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2007

Numerical techniques for computing the inertia of products of matrices of rational numbers.

John P. May, B. David Saunders, David Harlan Wood

Proceedings of the Symbolic-Numeric Computation, 2007

Efficient matrix rank computation with application to the study of strongly regular graphs.

John P. May, David Saunders, Zhendong Wan

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

LinBox and future high performance computer algebra.

Bruce W. Char, B. David Saunders, Bryan S. Youse

Proceedings of the Parallel Symbolic Computation, 2007

2005

Signature of symmetric rational matrices and the unitary dual of lie groups.

Jeffrey Adams, B. David Saunders, Zhendong Wan

Proceedings of the Symbolic and Algebraic Computation, 2005

2004

Smith normal form of dense integer matrices fast algorithms into practice.

David Saunders, Zhendong Wan

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms.

Jean-Guillaume Dumas, Frank Heckenbach, B. David Saunders, Volkmar Welker

Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003

2001

On Efficient Sparse Integer Matrix Smith Normal Form Computations.

Jean-Guillaume Dumas, B. David Saunders, Gilles Villard

J. Symb. Comput., 2001

Black box methods for least squares problems.

B. David Saunders

Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

2000

Integer Smith form via the valence: experience with large sparse matrices from homology.

Jean-Guillaume Dumas, B. David Saunders, Gilles Villard

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1997

Parametric linear systems: the two parameter case.

Mark Giesbrecht, David Saunders

SIGSAM Bull., 1997

Certifying inconsistency of sparse linear systems.

Mark Giesbrecht, Austin Lobo, David Saunders

SIGSAM Bull., 1997

1996

Sparse shifts for univariate polynomials.

Yagati N. Lakshman, B. David Saunders

Appl. Algebra Eng. Commun. Comput., 1996

1995

Sparse Polynomial Interpolation in Nonstandard Bases.

Yagati N. Lakshman, B. David Saunders

SIAM J. Comput., 1995

Fraction Free Gaussian Elimination for Sparse Matrices.

Hong R. Lee, B. David Saunders

J. Symb. Comput., 1995

1994

Some Experiments with Parallel Bignum Arithmetic.

Bruce W. Char, Jeremy Johnson, David Saunders, Andrew P. Wack

Proceedings of the First International Symposium on Parallel Symbolic Computation, 1994

On Computing Sparse Shifts for Univariate Polynomials.

Yagati N. Lakshman, B. David Saunders

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1991

On Wiedemann's Method of Solving Sparse Linear Systems.

Erich L. Kaltofen, B. David Saunders

Proceedings of the Applied Algebra, 1991

1989

A Parallel Implementation of the Cylindrical Algebraic Decomposition Algorithm.

B. David Saunders, Hong R. Lee, S. Kamal Abdali

Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1987

Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices.

Erich L. Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders

Proceedings of the EUROCAL '87, 1987

1986

Fast parallel algorithms for similarity of matrices.

Erich L. Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders

Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1986

1985

Transitive Closure and Related Semiring Properties via Eliminants.

S. Kamal Abdali, B. David Saunders

Theor. Comput. Sci., 1985

An Extension of Liouville's Theorem on Integration in Finite Terms.

Michael F. Singer, B. David Saunders, Bob F. Caviness

SIAM J. Comput., 1985

An Algebraic Implementation of Packages.

Snorri Agnarsson, Mukkai S. Krishnamoorthy, B. David Saunders

Proceedings of the EUROCAL '85, 1985

1984

Operational Calculus Technique for Solving Differential Equations.

Nikolaos Glinos, B. David Saunders

Proceedings of the EUROSAM 84, 1984

1983

A Generalized Class of Polynomials that are Hard to Factor.

Erich L. Kaltofen, David R. Musser, B. David Saunders

SIAM J. Comput., 1983

1981

Algebra made mechanical.

B. David Saunders

SIGSAM Bull., 1981

Abstracts.

B. David Saunders

SIGSAM Bull., 1981

An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations.

B. David Saunders

Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1981

1980

A survey of available systems.

B. David Saunders

SIGSAM Bull., 1980

1978

Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices.

B. David Saunders, Hans Schneider

Discret. Math., 1978