B David Saunders
B David Saunders
Professor of Computer Science, University of Delaware
Verifierad e-postadress på udel.edu - Startsida
TitelCiteras avÅr
On Wiedemann's method of solving sparse linear systems
E Kaltofen, BD Saunders
International Symposium on Applied Algebra, Algebraic Algorithms, and Error …, 1991
2231991
On efficient sparse integer matrix Smith normal form computations
JG Dumas, BD Saunders, G Villard
Journal of Symbolic Computation 32 (1-2), 71-99, 2001
1072001
LinBox: A generic library for exact linear algebra
JG Dumas, T Gautier, M Giesbrecht, P Giorgi, B Hovinen, E Kaltofen, ...
Proceedings of the 2002 International Congress of Mathematical Software …, 2002
1052002
Parallel algorithms for matrix normal forms
E Kaltofen, MS Krishnamoorthy, BD Saunders
Linear Algebra and its Applications 136, 189-208, 1990
971990
Fast parallel computation of Hermite and Smith forms of polynomial matrices
E Kaltofen, MS Krishnamoorthy, BD Saunders
SIAM Journal on Algebraic Discrete Methods 8 (4), 683-690, 1987
951987
Efficient matrix preconditioners for black box linear algebra
L Chen, W Eberly, E Kaltofen, BD Saunders, WJ Turner, G Villard
Linear Algebra and its Applications 343, 119-146, 2002
832002
Sparse polynomial interpolation in nonstandard bases
YN Lakshman, BD Saunders
SIAM Journal on Computing 24 (2), 387-397, 1995
591995
An extension of Liouville’s theorem on integration in finite terms
MF Singer, BD Saunders, BF Caviness
SIAM Journal on Computing 14 (4), 966-990, 1985
521985
A generalized class of polynomials that are hard to factor
E Kaltofen, DR Musser, BD Saunders
SIAM Journal on Computing 12 (3), 473-483, 1983
501983
Certifying inconsistency of sparse linear systems
M Giesbrecht, A Lobo, BD Saunders
Proceedings of the 1998 international symposium on Symbolic and algebraic …, 1998
451998
Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
BD Saunders, H Schneider
Discrete Mathematics 24 (2), 205-220, 1978
401978
Transitive closure and related semiring properties via eliminants
SK Abdali, BD Saunders
Theoretical Computer Science 40, 257-274, 1985
361985
A parallel implementation of the cylindrical algebraic decomposition algorithm
BD Saunders, HR Lee, SK Abdali
Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and …, 1989
281989
Integer Smith form via the valence: experience with large sparse matrices from homology
JG Dumas, BD Saunders, G Villard
Proceedings of the 2000 international symposium on Symbolic and algebraic …, 2000
242000
An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations
BD Saunders
Proceedings of the fourth ACM symposium on Symbolic and algebraic …, 1981
241981
Quadratic-time certificates in linear algebra
EL Kaltofen, M Nehring, BD Saunders
Proceedings of the 36th international symposium on Symbolic and algebraic …, 2011
202011
Issues of explanation in linguistics
GA Sanders
Explaining Linguistic Phenomena. NY: John Wiley & Sons, 1-20, 1974
20*1974
Fraction free Gaussian elimination for sparse matrices
HR Lee, BD Saunders
Journal of symbolic computation 19 (5), 393-402, 1995
191995
Sparse shifts for univariate polynomials
YN Lakshman, BD Saunders
Applicable Algebra in Engineering, Communication and Computing 7 (5), 351-364, 1996
171996
Cones, graphs and optimal scalings of matrices
BD Saunders, H Schneider
Linear and Multilinear Algebra 8 (2), 121-135, 1979
161979
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20