Fast computation for Smith forms of sparse matrices over local rings.
Proc. 2012 Internat. Symp. Symbolic Algebraic Comput.
ISSAC'12, Grenoble, France, July 22-25, pages 146-153, ACM Press, 2012.
Dealing with performance/portability and performance/accuracy trade-offs in heterogeneous computing systems: A case study with matrix multiplication modulo primes.
Proceedings of the DSS11 SPIE Defense, Security, and Sensing Symposium - Modeling and Simulation for Defense Systems and Applications VI, 2012.
Numeric-Symbolic Exact Rational Linear System Solver.
Proc. 2011 Internat. Symp. Symbolic Algebraic Comput.
ISSAC'11, San Jose, CA, USA, June 9-11, pages 305--312, ACM Press, 2011.
Quadratic-Time Certificates in Linear Algebra.
Proc. 2011 Internat. Symp. Symbolic Algebraic Comput.
ISSAC'11, San Jose, CA, USA, June 9-11, pages 171--176, ACM Press, 2011.
A Theory of Coprime Blurred Pairs.
In ICCV, 2011.
Linbox founding scope allocation, parallel building blocks, and separate compilation.
In K. Fukuda, J. vander Hoeven, M. Joswig, and N. Takayama, editors, ICMS'10, Proceedings of the Third international congress conference on Mathematical software, pages 77-83. Springer Verlag, LNCS 6327, 2010.
Large matrix, small rank.
In ISSAC 09 Proc. 2009 Internat. Symp. Symbolic Algebraic Comput., pages 317?324. ACM Press, 2009.
Linbox and future high performance computer algebra.
In Internat. Symp. Parallel Symbolic Comput. PASCO, pages 102-103. ACM Press, 2007.
Numerical techniques for computing the interta of products of matrices of rational numbers.
In SNC'07, pages 125-132. ACM Press, 2007.
Efficient matrix rank computation with application to the study of strongly regular graphs.
In ISSAC 07 Proc. 2007 Internat. Symp. Symbolic Algebraic Comput., pages 277-284. ACM Press, 2007.
Hybrid methods for smith normal form of sparse integer matrices.
(postscript), 2006.
Signature of symmetric rational matrices and the unitary dual of lie groups.
In ISSAC 05 Proc. 2005 Internat. Symp. Symbolic Algebraic Comput., pages 13-20. ACM Press, 2005.
Smith normal form of dense integer matrices, fast algorithms into practice.
In ISSAC 04 Proc. 2004 Internat. Symp. Symbolic Algebraic Comput., pages 274-281. ACM Press, 2004.
Tighter probability bounds for randomized linear algebra algorithms.
May 8, 2004.
Matrix rank certification.
Electronic J. of Linear Algebra, 11:16-23, 2004.
Computing simplicial homology based on efficient smith normal form algorithms.
In M. Joswig and N. Takayama, editors, Algebra, Geometry, and Software Systems, pages 177-206. Springer Verlag, 2003.
(gzipped postscript).
Rank of sparse 0,1,-1 matrices.
In Proceeding of the SIAM International Conference on Applied Linear Algebra. online at
www.siam.org/meetings/la03/proceedings,
2003.
(gzipped pdf).
Rank and smith form of extremely sparse matrices.
In International Conference on Applications of Computer Algebra. No proceedings, 2003.
Linear systems.
In J. Grabmeier, E. Kaltofen, and V. Weispfenning, editors, Computer Algebra Handbook, pages 36-38. Springer Verlag, 2003.
Exact solution to large sparse integer linear systems.
2002.
Genblas: Basic linear algebra subroutines in c++ over any fields.
2002.
Linbox: A generic library for exact linear algebra.
In A. Cohen, X-S Gao, and N. Takayama, editors, Mathematical Software: ICMS 2002 (Proceedings of the first International Congress of Mathematical Software), pages 40-50. World Scientific, 2002.
Efficient matrix preconditioners for black box linear algebra.
Linear Algebra and Applications, 343-344:119-146, 2002.
Black box methods for least squares problems.
In ISSAC 01 Proc. 2001 Internat. Symp. Symbolic Algebraic Comput., pages 297-302. ACM Press, 2001.
On efficient sparse integer matrix smith normal form computations.
J. Symbolic Comput., 32:71-99, 2001.
Integer smith form via the valence: Experience with large sparse matrices from homology.
In ISSAC 00 Proc. 2000 Internat. Symp. Symbolic Algebraic Comput., pages 95-105. ACM Press, 2000.
Certifying inconsistency of sparse linear systems.
In ISSAC 98 Proc. 1998 Internat. Symp. Symbolic Algebraic Comput., pages 113-119. ACM Press, 1998.
(postscript).
Solving parametric linear systems.
(postscript), 1998.
Parametric linear systems, the bivariate case.
1997.
A fast certificate of inconsistency for large sparse linear systems.
1997.
Parameter
indeterminate.
1997.
On computing sparse shifts for univariate polynomials.
J. of AAECC, 7,5:351-364, 1996.
(postscript).
Sparse polynomial interpolation in non-standard bases.
SIAM J. Comput., 24(2):387-397, 1995.
(postscript).
Fraction free gaussian elimination for sparse matrices.
J. Symbolic Comput., 19:393-402, 1995.
(postscript).
Some experiments with parallel bignum arithmetic.
In Proc. 1994 Internat. Symp. Parallel Symbolic Comput. PASCO, pages 94-103. World Scientific, 1994.
(postscript).
A note on computing sparse shifts for univariate polynomials.
In ISSAC '94 Proc. Internat. Symp. Symbolic Algebraic Comput., pages 108-113, 1994.
On Wiedemann's method of solving sparse linear systems.
In H. F. Mattson, T. Mora, and T. R. N. Rao, editors, Proc. AAECC-9, volume 539 of Lect. Notes Comput. Sci., pages 29-38, Heidelberg, Germany, 1991. Springer Verlag.
(postscript).
Distributed computation of minor expansions.
Technical Report Drexel Department of Mathematics and Computer Science Technical Report MCS-91-2.
On scheduling algebraic algorithms for parallel execution.
Technical Report U. of Delaware Department of Computer and Information Sciences Technical Report CIS TR-9015.
postscript.
Parallel algorithms for matrix normal forms.
Linear Algebra and Applications, 136:189-208, 1990.
Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith normal form of polynomial matrices.
In J. H. Davenport, editor, Proc. EUROCAL '87, volume 378 of Lect. Notes Comput. Sci., pages 317-322, Heidelberg, Germany, 1989. Springer Verlag.
Journal version in [30].
A parallel implementation of the cylindrical algebraic decomposition algorithm.
Matrix computations in computer algebra systems.
Technical Report U. of Delaware Center for Mathematical Computation Technical Report CMC-8808.
Fast parallel computation of Hermite and Smith forms of polynomial matrices.
SIAM J. Alg. Discrete Math., 8:683-690, 1987.
Fast parallel algorithms for similarity of matrices.
In B. W. Char, editor, Proc. 1986 ACM Symp. Symbolic and Algebraic Comput., pages 65-70, New York, N. Y., 1986. ACM.
Journal version in [34] and [30].
Transitive closure and related semiring properties via eliminants.
Theoretical Computer Science, 40:257-274, 1985.
An extension of Liouville's theorem on integration in finite terms.
SIAM J. Comput., 14:966-990, 1985.
Primality of ideals in polynomial rings.
In Proc. 1984 MACSYMA Users Conference, pages 459-471, 1984.
Complexity of testing whether a polynomial ideal is nontrivial.
In Proc. 1984 MACSYMA Users Conference, pages 452-458, 1984.
Operational calculus techniques for solving differential equations.
In EUROSAM '84, pages 23-34, 1984.
A generalized class of polynomials that are hard to factor.
SIAM J. Comput., 12(3):473-485, 1983.
A generalized class of polynomials that are hard to factor, extended abstract.
In Proc. 1981 ACM Symp. Symbolic and Algebraic Comput., pages 188-194. ACM, 1981.
Journal version in [41].
Matrices with zero-line-sums and maximal rank.
Linear Algebra and Applications, 40:229-235, 1981.
An extension of Liouville's theorem on integration in finite terms (extended abstract).
In Proc. 1981 ACM Symp. Symbolic and Algebraic Comput., pages 23-24, 1981.
Journal version in [37].
An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations.
In Proc. 1981 ACM Symp. Symbolic and Algebraic Comput., pages 105-108. ACM, 1981.
Applications of the Gordan-Stiemke theorem in combinatorial matrix theory.
SIAM Review, 21:528-541, 1979.
Cones, graphs and optimal scalings of matrices.
Linear and Multilinear Algebra, 8:121-135, 1979.
Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices.
Discrete Mathematics, 24:205-220, 1978.
On the geometry of dual pairs.
Studies in Appl. Math., 56:71-79, 1977.
A condition for the convexity of the norm-numerical range of a matrix.
Linear Algebra and Applications, 16:167-175, 1977.
A symmetric numerical range for matrices.
Numerische Math., 26:99-105, 1976.