MOCAA M^3 2008 Program

CECM Home > Events > MOCAA M³ 2008 > Program

MOCAA M³ 2008 Home Registration Program Participants Abstracts Slides

Proposed Program Outline

All talks will be held in Middlesex College Room 6 (ground level) at the University of Western Ontario, London, Ontario.

Tuesday May 6th: Parallel Programming
9:00	Marc Moreno-Maza	Scheduling parallel algorithms in computer algebra (part I).
10:30	break
11:00	Marc Moreno-Maza	Scheduling parallel algorithms in computer algebra (part II)
12:30	lunch
14:00	David Linder	LinearAlgebra: some missing documentation
15:00	close
Wednesday May 7th: Polynomials I
09:00	Roman Pearce	Sparse polynomial arithmetic part I: High Performance
09:45	Michael Monagan	Sparse polynomial arithmetic part II: A proposal to dramatically speed up polynomials in Maple
10:30	break
11:00	Stephen Watt	Functional Decomposition of Symbolic Polynomials
11:45	Paul Vrbik	A package for delayed polynomial arithmetic
12:15	lunch
13:30	Wei Pan	When does (T) equal Sat(T)?
14:00	Muhammad Chowdhury	Multiplication modulo triangular sets.
14:30	Jie Wu	Evaluation properties of invariant polynomials.
15:00	break
15:30	Mark Giesbrecht	Detecting perfect powers of lacunary polynomials.
16:00	Oleg Golubitsky	A bound that reduces differential Nullstellensatz to the algebraic one.
16:30	Wenyuan Wu	Challenges and Progress in Geometric Methods of Differential Systems
17:00	close
Thursday May 8th: Linear Algebra
9:00	David Linder	Parallel linear algebra in Maple
10:00	Arne Storjohann	Triangularizing integer matrices
10:30	break
11:00	George Labahn	Recent Progress with Order Bases
11:30	Wei Zhou	Efficient Order Basis Computation
12:00	lunch
13:30	Howard Cheng	Computations with Ore Polynomial Matrices
14:00	John May	A Symbolic-Numeric Approach to Computing Inertia of Products of Matrices of Rational Numbers
14:30	break
15:00	Daniel Roche	The LinBox project for linear algebra computations (tutorial)
15:45	break
16:00	Daniel Roche	The LinBox project for linear algebra computations (tutorial)
17:00	close
Friday May 9th: Polynomials II
09:00	Changbo Chen	Triangular Decompositions for Solving Parametric Polynomial Systems
9:30	Liyun Li	Computing with Constructible Sets
10:00	Yuzhen Xie	On the Representation of Constructible Sets
10:30	break
11:00	Marc Moreno-Maza	The Modpn library: Bringing Fast Polynomial Arithmetic into Maple
11:45	Mahdi Javadi	A new solution to the polynomial GCD normalization problem
12:15	lunch
14:00	Juergen Gerhard	Advanced Maple Programming
15:00	break
15:30	Juergen Gerhard	Using compiled code from within Maple
16:30	close