B. David Saunders

Publication Activity (10 Years)

Years Active: 1978-2022
Publications (10 Years): 10

Top Topics

Extended Abstract

Polynomially Bounded

Sparse Matrices

Top Venues

ACM Commun. Comput. Algebra

J. Symb. Comput.

Publications

Gavin Harrison, Jeremy R. Johnson, B. David Saunders
Probabilistic analysis of block Wiedemann for leading invariant factors. J. Symb. Comput. 108 (2022)
Robert M. Corless, Leili Rafiee Sevyeri, B. David Saunders
Equivalences for Linearizations of Matrix Polynomials. ISSAC (2021)
Robert M. Corless, Leili Rafiee Sevyeri, B. David Saunders
Equivalences for Linearizations of Matrix Polynomials. CoRR (2021)
Robert M. Corless, Mark Giesbrecht, Leili Rafiee Sevyeri, B. David Saunders
On Parametric Linear System Solving. CASC (2020)
Gavin Harrison, Jeremy R. Johnson, B. David Saunders
Probabilistic Analysis of Block Wiedemann for Leading Invariant Factors. CoRR (2018)
Matthew A. Lambert, B. David Saunders
Compiler auto-vectorization of matrix multiplication modulo small primes. PASCO@ISSAC (2017)
Gavin Harrison, Jeremy R. Johnson, B. David Saunders
Probabilistic analysis of block wiedemann for leading invariant factors. ACM Commun. Comput. Algebra 50 (4) (2016)
Gavin Harrison, Jeremy R. Johnson, B. David Saunders
Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation. J. Symb. Comput. 74 (2016)
B. David Saunders
Matrices with Two Nonzero Entries per Row. ISSAC (2015)
Andrew Novocin, B. David Saunders, Alexander Stachnik, Bryan S. Youse
3-ranks for strongly regular graphs. PASCO (2015)
Gavin Harrison, Jeremy R. Johnson, B. David Saunders
Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation. CoRR (2014)
Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet, B. David Saunders
Elements of Design for Containers and Solutions in the LinBox Library. CoRR (2014)
Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet, B. David Saunders
Elements of Design for Containers and Solutions in the LinBox Library - Extended Abstract. ICMS (2014)
Gavin Harrison, Jeremy R. Johnson, B. David Saunders
Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation. ACM Commun. Comput. Algebra 47 (3/4) (2013)
Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin, B. David Saunders
Fast Computation of Smith Forms of Sparse Matrices Over Local Rings CoRR (2012)
Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin, B. David Saunders
Fast computation of Smith forms of sparse matrices over local rings. ISSAC (2012)
B. David Saunders, David Harlan Wood, Bryan S. Youse
Numeric-symbolic exact rational linear system solver. ISSAC (2011)
Erich Kaltofen, Michael Nehring, B. David Saunders
Quadratic-time certificates in linear algebra. ISSAC (2011)
Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, B. David Saunders
LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation. ICMS (2010)
Bryan S. Youse, B. David Saunders
Abstract only: Bitslicing with matrix algorithms oblivious to the data compression. ACM Commun. Comput. Algebra 44 (1/2) (2010)
Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, B. David Saunders
LinBox founding scope allocation, parallel building blocks, and separate compilation CoRR (2010)
B. David Saunders, Bryan S. Youse
Large matrix, small rank. ISSAC (2009)
Jean-Guillaume Dumas, Clément Pernet, B. David Saunders
On finding multiplicities of characteristic polynomial factors of black-box matrices CoRR (2009)
Jean-Guillaume Dumas, Clément Pernet, B. David Saunders
On finding multiplicities of characteristic polynomial factors of black-box matrices. ISSAC (2009)
John P. May, B. David Saunders, David Harlan Wood
Numerical techniques for computing the inertia of products of matrices of rational numbers. SNC (2007)
John P. May, B. David Saunders, Zhendong Wan
Efficient matrix rank computation with application to the study of strongly regular graphs. ISSAC (2007)
Bruce W. Char, B. David Saunders, Bryan S. Youse
LinBox and future high performance computer algebra. PASCO (2007)
Jeffrey Adams, B. David Saunders, Zhendong Wan
Signature of symmetric rational matrices and the unitary dual of lie groups. ISSAC (2005)
B. David Saunders, Zhendong Wan
Smith normal form of dense integer matrices fast algorithms into practice. ISSAC (2004)
Jean-Guillaume Dumas, Frank Heckenbach, B. David Saunders, Volkmar Welker
Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms. Algebra, Geometry, and Software Systems (2003)
Jean-Guillaume Dumas, B. David Saunders, Gilles Villard
On Efficient Sparse Integer Matrix Smith Normal Form Computations. J. Symb. Comput. 32 (1/2) (2001)
B. David Saunders
Black box methods for least squares problems. ISSAC (2001)
Jean-Guillaume Dumas, B. David Saunders, Gilles Villard
Integer Smith form via the valence: experience with large sparse matrices from homology. ISSAC (2000)
Mark Giesbrecht, Austin Lobo, B. David Saunders
Certifying Inconsistency of Sparse Linear Systems. ISSAC (1998)
Mark Giesbrecht, Austin Lobo, B. David Saunders
Certifying inconsistency of sparse linear systems. SIGSAM Bull. 31 (3) (1997)
Yagati N. Lakshman, B. David Saunders
Sparse Shifts for Univariate Polynomials. Appl. Algebra Eng. Commun. Comput. 8 (6) (1997)
Mark Giesbrecht, B. David Saunders
Parametric linear systems: the two parameter case. SIGSAM Bull. 31 (3) (1997)
Yagati N. Lakshman, B. David Saunders
Sparse shifts for univariate polynomials. Appl. Algebra Eng. Commun. Comput. 7 (5) (1996)
Hong R. Lee, B. David Saunders
Fraction Free Gaussian Elimination for Sparse Matrices. J. Symb. Comput. 19 (5) (1995)
Yagati N. Lakshman, B. David Saunders
Sparse Polynomial Interpolation in Nonstandard Bases. SIAM J. Comput. 24 (2) (1995)
Yagati N. Lakshman, B. David Saunders
On Computing Sparse Shifts for Univariate Polynomials. ISSAC (1994)
Erich Kaltofen, B. David Saunders
On Wiedemann's Method of Solving Sparse Linear Systems. AAECC (1991)
B. David Saunders, Hong R. Lee, S. Kamal Abdali
A Parallel Implementation of the Cylindrical Algebraic Decomposition Algorithm. ISSAC (1989)
Erich Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders
Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices. EUROCAL (1987)
Erich Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders
Fast parallel algorithms for similarity of matrices. SYMSAC (1986)
Michael F. Singer, B. David Saunders, B. F. Caviness
An Extension of Liouville's Theorem on Integration in Finite Terms. SIAM J. Comput. 14 (4) (1985)
Snorri Agnarsson, Mukkai S. Krishnamoorthy, B. David Saunders
An Algebraic Implementation of Packages. European Conference on Computer Algebra (2) (1985)
S. Kamal Abdali, B. David Saunders
Transitive Closure and Related Semiring Properties via Eliminants. Theor. Comput. Sci. 40 (1985)
Nikolaos Glinos, B. David Saunders
Operational Calculus Technique for Solving Differential Equations. EUROSAM (1984)
Erich Kaltofen, David R. Musser, B. David Saunders
A Generalized Class of Polynomials that are Hard to Factor. SIAM J. Comput. 12 (3) (1983)
B. David Saunders
Abstracts. SIGSAM Bull. 15 (2) (1981)
B. David Saunders
An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations. SYMSACC (1981)
Erich Kaltofen, David R. Musser, B. David Saunders
A generalized class of polynomials that are hard to factor. SYMSACC (1981)
B. David Saunders
Algebra made mechanical. SIGSAM Bull. 15 (3) (1981)
Michael F. Singer, B. David Saunders, B. F. Caviness
An extension of Liouville's theorem on integration in finite terms. SYMSACC (1981)
B. David Saunders
A survey of available systems. SIGSAM Bull. 14 (4) (1980)
B. David Saunders, Hans Schneider
Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices. Discret. Math. 24 (2) (1978)