B. David Saunders

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