B. David Saunders - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Quadratic-time certificates in linear algebraErich Kaltofen, Michael Nehring, B. David Saunders. issac 2011: 171-176 [doi]

Numeric-symbolic exact rational linear system solverB. David Saunders, David Harlan Wood, Bryan S. Youse. issac 2011: 305-312 [doi]

2010

LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate CompilationJean-Guillaume Dumas, Thierry Gautier, Clément Pernet, B. David Saunders. icms 2010: 77-83 [doi]

2009

On finding multiplicities of characteristic polynomial factors of black-box matricesJean-Guillaume Dumas, ClÃ©ment Pernet, B. David Saunders. issac 2009: 135-142 [doi]

Large matrix, small rankB. David Saunders, Bryan S. Youse. issac 2009: 317-324 [doi]

2007

LinBox and future high performance computer algebraBruce W. Char, B. David Saunders, Bryan Youse. issac 2007: 102-103 [doi]

Numerical techniques for computing the inertia of products of matrices of rational numbersJohn P. May, B. David Saunders, David Harlan Wood. issac 2007: 125-132 [doi]

Efficient matrix rank computation with application to the study of strongly regular graphsJohn P. May, B. David Saunders, Zhendong Wan. issac 2007: 277-284 [doi]

2005

Signature of symmetric rational matrices and the unitary dual of lie groupsJeffrey Adams, B. David Saunders, Zhendong Wan. issac 2005: 13-20 [doi]

2004

Smith normal form of dense integer matrices fast algorithms into practiceB. David Saunders, Zhendong Wan. issac 2004: 274-281 [doi]

2003

Computing Simplicial Homology Based on Efficient Smith Normal Form AlgorithmsJean-Guillaume Dumas, Frank Heckenbach, B. David Saunders, Volkmar Welker. dagstuhl 2003: 177-206

2001

On Efficient Sparse Integer Matrix Smith Normal Form ComputationsJean-Guillaume Dumas, B. David Saunders, Gilles Villard. JSC, 32(1/2):71-99, 2001.

Black box methods for least squares problemsB. David Saunders. issac 2001: 297-302 [doi]

2000

Integer Smith form via the valence: experience with large sparse matrices from homologyJean-Guillaume Dumas, B. David Saunders, Gilles Villard. issac 2000: 95-105 [doi]

1998

Certifying Inconsistency of Sparse Linear SystemsMark Giesbrecht, A. Lobo, B. David Saunders. issac 1998: 113-119 [doi]

1997

Sparse Shifts for Univariate PolynomialsYagati N. Lakshman, B. David Saunders. aaecc, 8(6):561-562, 1997. [doi]

1996

Sparse Shifts for Univariate PolynomiaYagati N. Lakshman, B. David Saunders. aaecc, 7(5):351-364, 1996. [doi]

1995

Sparse Polynomial Interpolation in Nonstandard BasesYagati N. Lakshman, B. David Saunders. siamcomp, 24(2):387-397, 1995.

Fraction Free Gaussian Elimination for Sparse MatricesHong R. Lee, B. David Saunders. JSC, 19(5):393-402, 1995.

1994

On Computing Sparse Shifts for Univariate PolynomialsYagati N. Lakshman, B. David Saunders. issac 1994: 108-113 [doi]

1991

On Wiedemann s Method of Solving Sparse Linear SystemsErich Kaltofen, B. David Saunders. AAECC 1991: 29-38

1989

A Parallel Implementation of the Cylindrical Algebraic Decomposition AlgorithmB. David Saunders, Hong R. Lee, S. Kamal Abdali. issac 1989: 298-307 [doi]

1987

Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matricesErich Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders. eurocal 1989: 317-322

1985

Transitive Closure and Related Semiring Properties via EliminantsS. Kamal Abdali, B. David Saunders. TCS, 40:257-274, 1985.

An Algebraic Implementation of PackagesSnorri Agnarsson, Mukkai S. Krishnamoorthy, B. David Saunders. eurocal 1985: 291-302

An Extension of Liouville s Theorem on Integration in Finite TermsMichael F. Singer, B. David Saunders, B. F. Caviness. siamcomp, 14(4):966-990, 1985.

1984

Operational Calculus Technique for Solving Differential EquationsNikolaos Glinos, B. David Saunders. eurosam 1984: 23-34

1983

A Generalized Class of Polynomials that are Hard to FactorErich Kaltofen, David R. Musser, B. David Saunders. siamcomp, 12(3):473-483, 1983.