EM-Tu-E-01
Third Workshop on Hybrid Methodologies for Symbolic-Numeric Computation - Part IV of VIII
For Part I, see EM-Mo-D-01
For Part II, see EM-Mo-E-01
For Part III, see EM-Tu-D-01
For Part V, see EM-We-D-01
For Part VI, see EM-We-E-01
For Part VII, see EM-Th-BC-01
For Part VIII, see EM-Th-D-01
Date: August 11, Tuesday
Time: 16:00--18:30
Room: 311A
(Note: Click title to show the abstract.)
Organizer:
Giesbrecht, Mark (Univ. of Waterloo)
Kaltofen, Erich (North Carolina State Univ.)
Safey El Din, Mohab (Univ. Pierre & Marie Curie)
Zhi, Lihong [chair] (Acad. of Mathematics & Sys. Sci.)
Abstract: Hybrid symbolic-numeric computation methods, which first
appeared some twenty years ago, have gained considerable
prominence. Algorithms have been developed that improve
numeric robustness (e.g., in quadrature or solving ODE
systems) using symbolic techniques prior to, or during, a
numerical solution. Likewise, traditionally symbolic
algorithms have seen speed improvements from adaptation of
numeric methods (e.g., lattice reduction methods). There is
also an emerging approach of characterizing, locating, and
solving ``interesting nearby problems'', wherein one seeks
an important event (for example a nontrivial factorization
or other useful singularities), that in some measure is
close to a given problem (one that might have only
imprecisely specified data). Many novel techniques have been
developed in these complementary areas, but there is a
general belief that a deeper understanding and wider
approach will foster future progress. The problems we are
interested are driven by applications in computational
physics (quadrature of singular integrals), dynamics
(symplectic integrators), robotics (global solutions of direct
and inverse problems near singular manifolds), control
theory (stability of models), and the engineering of
large-scale continuous and hybrid discrete-continuous
dynamical systems. Emphasis will be given to validated
and certified outputs via algebraic and exact techniques,
error estimation, interval techniques and optimization
strategies.
Our workshop will follow up on the seminal SIAM-MSRI
Workshop on Hybrid Methodologies for Symbolic-Numeric
Computation held in November 2010 and the Fields Institute
Workshop on Hybrid Methodologies for Symbolic-Numeric
Computation, November 16-19, 2011 at the University of
Waterloo, Canada. We will provide a forum for researchers on
all sides of hybrid symbolic-numeric computation.
EM-Tu-E-01-1
16:00--16:30
Approximate polynomial Smith decomposition
Lichtblau, Daniel (Wolfram Research)
EM-Tu-E-01-2
16:30--17:00
A hybrid approach for the center-focus problem
Hauenstein, Jonathan (Univ. ot Notre Dame)
EM-Tu-E-01-3
17:00--17:30
Connectivity queries on space curves
Schost, Eric (Western Univ.)
EM-Tu-E-01-4
17:30--18:00
The Nearest Polynomial with Two or More Given Zeros
Sekigawa, Hiroshi (Tokyo Univ. of Sci.)
EM-Tu-E-01-5
18:00--18:30
Certifying and computing the simple zeros of over-determined polynomial systems.
Cheng, Jin-San (Chinese Acad. of Sci.)
Footnote: Code: Type-Date-Time-Room No. Type : IL=Invited Lecture, SL=Special Lectures, MS=Minisymposia, IM=Industrial Minisymposia, CP=Contributed Papers, PP=Posters Date: Mo=Monday, Tu=Tuesday, We=Wednesday, Th=Thursday, Fr=Friday Time : A=8:30-9:30, B=10:00-11:00, C=11:10-12:10, BC=10:00-12:10, D=13:30-15:30, E=16:00-18:00, F=19:00-20:00, G=12:10-13:30, H=15:30-16:00 Room No.: TBA |