Fields Logo

Fields Institute Workshop on Hybrid Methodologies for Symbolic-Numeric Computation

November 16-19, 2011
The University of Waterloo, Waterloo, Ontario, Canada

 UW Logo

Tentative Schedule of Talks

Abstracts and titles for all talks can be found here, and the workshop main page here.

Wednesday, November 16, 2011

9:00 – 9:15 Opening
9:15 – 10:00 Erich Kaltofen, North Carolina State University, USA
10:00 – 10:30 Coffee break
10:30 – 11:00 Feng Guo, Chinese Academy of Sciences, Beijing, China and NC State University, USA – Certifying degree lower bounds for the Hilbert-Artin representation of positive semidefinite rational functions
11:00 – 11:30 Bingyu Li, Northeast Normal University, Changchun, China – On the Condition Number of the Total Least Squares Problem
11:30 – 12:00 Stephen Watt, University of Western Ontario, Canada – Approximate polynomials and definite integrals
12:00 – 13:30 Lunch
13:30 – 14:15 Kosaku Nagasaka, Kobe University, Japan – A Symbolic-Numeric Approach to Gröbner Basis with Inexact Input
14:15 – 14:45 Coffee break
14:45 – 17:15 Steve Vavasis, University of Waterloo, Canada – Condition numbers in the solution of polynomial equations

Thursday, November 17, 2011

9:00 – 9:45 Laurent Bernardin, Maplesoft, Canada – Symbolic Computing in Modeling and Simulation
9:50 – 10:15 Katya Vladislavleva, Evolved Analytics, Belgium – Symbolic regression for modeling complex continuous and discrete- continuous systems
10:15 – 10:45 Coffee break
10:45 – 11:30 Annie Cuyt, Universiteit Antwerpen (CMI), Belgium – Sparse Interpolation and Signal Processing
11:30 – 12:00 Maryam Fazel, University of Washington, USA – Strong Conditions for Recovering Low-rank Matrices
12:00 – 13:30 Lunch
13:30 – 14:15 Wen-shin Lee, Universiteit Antwerpen (CMI), Belgium – Multivariate Prony's Method
14:15 – 14:45 Coffee break
14:45 – 17:15 Anton Leykin, Georgia Tech, USA – Numerical Algebraic Geometry
17:30 – 19:00 Reception (DC1301)

Friday, November 18, 2011

9:00 – 9:45 Gilles Villard, ENS Lyon, France – Some numerical considerations for lattice basis reduction
9:50 – 10:15 Dan Steffy, Zuse Institute Berlin, Germany and Oakland University, USA – Exact solutions to mixed-integer linear programming problems
10:15 – 10:45 Coffee break
10:45 – 11:30 Xiao-Wen Chang, McGill University, Canada – Lattice Reduction and Preconditioning
11:35 – 12:00 Daniel S. Roche, US Naval Academy, USA – Stable Sparse Interpolation with Fewer Samples
12:00 – 13:30 Lunch
13:30 – 14:15

Tateaki Sasaki, Tsukuba University, Japan – Approximate Gröbner Bases and Two Applications
14:20 – 14:45 Aurélien Greuet, SALSA Team (INRIA/CNRS/UPMC/LIP6) and Université de Versailles, France – Polar Varieties and Global Optimization Problem
14:45 – 15:15 Coffee break
15:30 – 15:55

Olivier Ruatta, Université de Limoges, France – On two different problems and methods for approximate GCD
16:00 – 16:25 David Jeffrey, University of Western Ontario, Canada – Stieltjes Integrals and Completely Monotonic Functions
16:25 – 16:45 Coffee break
16:45 – 18:00 Panel discussion

Saturday, November 19, 2011

9:00 – 9:45 Hoon Hong, North Carolina State University, USA – Hybrid Method for Solving Bivariate Polynomial System
9:50 – 10:15 Min Wu, East China Normal University, Shanghai, China – Exact Safety Verification of Hybrid Systems via Symbolic-Numeric Method
10:15 – 10:45 Coffee break
10:45 – 11:30

Adam Strzebonski, Wolfram Research, USA – Solving equations and inequalities using validated numeric methods
11:30 – 12:00

Hitoshi Yanami, Fujitsu Laboratories, Japan – A quantifier elimination algorithm based on symbolic-numeric cylindrical algebraic decomposition
12:00 – 13:30 Lunch
13:30 – 14:15 Ken Jackson, University of Toronto, Canada – Validated Methods for Initial Value Problems for Ordinary Differential Equations
14:20 – 15:05 Wayne Hayes, University of California Irvine, USA – Shadowing as a measure of backward error in numerical simulations
15:05 – 15:15 Closing