Thursday, July 16

Symbolic-Numeric Algorithms for Polynomials (Part II of II)

This minisymposium is sponsored by Canadian Applied and Industrial Mathematics Society/Société Canadienne de Mathématiques Appliquées et Industrielles

2:00 PM-4:00 PM
Room: Sidney Smith 1073

(For description, see Part I, MS51).

Organizers: Robert M. Corless and Stephen M. Watt
University of Western Ontario, Canada
2:00 Structured Matrices, Polynomial Zeros, Polynomial GCDs and Polynomial Systems of Equations
Victor Ya. Pan, Lehman College, City University of New York
2:30 A Reordered Schur Factorization Method for Zero-Dimensional Polynomial Systems with Multiple Roots
Robert M. Corless, Organizer; Patrizia Gianni, University of Pisa, Italy; and Barry Trager, IBM Thomas J.Watson Research Center
3:00 A Test for the Irreducibility of Lacunary 0-1 Polynomials
Michael Filaseta and Douglas B. Meade, University of South Carolina, Columbia
3:30 Approximate Polynomial GCD's and Generic Gröbner Bases
Y. N. Lakshman, Drexel University; and Narendra Karmarkar, Tata Institute of Fundamental Research, Bombay, India

Program Program Overview Program-at-a-Glance Program Updates Speaker Index Registration Hotel Transportation

LMH Created: 3/19/98; MMD Updated: 5/28/98