Event Description
The Department of Computer Science at Drexel's College of Computing
& Informatics (CCI) presents the Dr. Werner Krandick Lecture
featuring Dr. Dave Saunders, professor
emeritus of the Computer
and Information Sciences Department at the University of Delaware.
Lecture Title: "Exact linear algebra algorithms for sparse integer matrices"
This free event is open to the Drexel University community. No registration is necessary.
Lecture Abstract:
Fast methods for linear algebra computations on sparse integer matrices is a relatively new development. Dr. Saunders will present the main algorithmic ideas supporting this evolution over the past three decades. He'll
comment on implementation in LinBox, a C++ template library for high
performance exact linear algebra on (dense and sparse) integer matrices
and, in support of that, also on matrices over finite fields and rings.
Through its approach to polymorphism, LinBox strives to support both
production code for applications and experimental code for new
algorithms (and paper writing). Dr. Saunders will use the three problems of linear system solving, determinant and matrix rank to illustrate. As time permits, he'll discuss challenges in computing matrix canonical forms. He will also
discuss some of the uses to which LinBox has been applied and note how
this diverges from and complements what is done in (approximate)
numerical linear algebra.
About the Speaker:
David Saunders is professor
emeritus, faculty member since 1985, and past chairman of the Computer
and Information Sciences Department at the University of Delaware. Prior to University of Delaware, he served on the faculty at Rensselaer Polytechnic Institute for 10 years. He earned his PhD in 1975 (under the direction of Hans Schneider) from the University of Wisconsin in
1975. His thesis concerned a linear algebra topic, proving properties of
norm numerical ranges (a generalization of Raleigh quotients). For the
next 20 years, however, his research concerned closed form integration,
polynomial factorization, sparse polynomials, parallel computation, and
software design issues of Scratchpad (now Axiom), a computer algebra
system of Dick Jenks' group at IBM Yorktown Heights. In the early 1990s
he returned to linear algebra, developing algorithms and implementations
in LinBox, a software library for high performance computations with
sparse integer matrices. Misc activities: Computer Algebra Niederland
Prize in 2002 for work on rank of matrices of rational multivariate
functions. Has been an editor of the Journal of Symbolic Computation.
Has been treasurer and bulletin editor of ACM SIGSAM. Program chair of
ISSAC 2006 (International Symposium on Symbolic and Algebraic
Computation), Genoa, Italy. |