Overview

Algorithms that combine techniques from symbolic and numeric computation have been of increasing importance and interest over the past decade. The necessity to work reliably with imprecise and noisy data, and for speed and accuracy within algebraic and hybrid-numerical problems, has encouraged a new synergy between the numerical and symbolic computing fields. Novel and exciting problems from industrial, mathematical and computational domains are now being explored and solved.

The goal of the present workshop is to support the interaction and integration of symbolic and numeric computing. Earlier meetings in this series include the SNAP 96 Workshop, held in Sophia Antipolis, France, the SNC 2005 meeting, held in Xi'an, China, SNC 2007 held in London, Canada, SNC 2009, held in Kyoto, and SNC 2011, held in San Jose, California USA.

This forthcoming International Workshop on Symbolic-Numeric Computation will be held July 28 to 31 in Shanghai, China, immediately following the ISSAC 2014 Symposium to be held in nearby Kobe, Japan.
Invited Speakers

Erich L. Kaltofen, North Carolina State university, USA:
Cleaning-Up Data for Sparse Model Synthesis:
When Symbolic-Numeric Computation Meets Error-Correcting Codes
Lawrence Paulson, University of Cambridge, UK:
Automated Theorem Proving For Special Functions: The Next Phase
Bernd Sturmfels, UC Berkeley, USA:
Maximum Likelihood for Matrices with Rank Constraints

The titles of the talks are tentative.
Conference Topics

Specific topics of SNC 2014 include, but are not limited to:

Hybrid symbolic-numeric algorithms in linear, polynomial and differential algebra
Approximate polynomial GCD and factorization
Symbolic-numeric methods for solving polynomial systems
Resultants and structured matrices for symbolic-numeric computation
Differential equations for symbolic-numeric computation
Symbolic-numeric methods for geometric computation
Symbolic-numeric algorithms in algebraic geometry
Symbolic-numeric algorithms for nonlinear optimization
Implementation of symbolic-numeric algorithms
Model construction by approximate algebraic algorithms
Applications of symbolic-numeric computation: global optimization, verification, etc.

Important dates
Paper submission deadline: 24 March 2014
Notification of acceptance/rejection: 28 April 2014
Camera-ready copy due: 19 May 2014

The submission site is https://www.easychair.org/conferences/?conf=snc2014 .

Submission details to be announced shortly.

Organizing Committee
General Chair: Lihong Zhi, Chinese Academy of Sciences, MMRC (lzhi@mmrc.iss.ac.cn)
Program Committee Chair: Stephen Watt, Western University (Stephen.Watt@uwo.ca)
Program Committee Vice Chair: Jan Verschelde (janv@uic.edu)
Local Organization Chair: Zhengfeng Yang, East China Normal University (zfyang@sei.ecnu.edu.cn)

Program Committee
Dario Bini Università di Pisa (Italy)
Jin-San Cheng Chinese Academy of Sciences (China)
Rob Corless University of Western Ontario (Canada)
André Galligo Université de Nice-Sophia Antipolis (France)
Patrizia Gianni Università di Pisa (Italy)
Mark Giesbrecht University of Waterloo (Canada)
Ilias Kotsireas Wilfrid Laurier University (Canada)
Bernard Mourrain INRIA Sophia Antipolis (France)
Kosaku Nagasaka Kobe University (Japan)
Victor Pan Lehman College, City University of New York (USA)
Mohab Safey El Din Université Paris 6 (France)
Michael Sagraloff Max-Planck-Institut fër Informatik (Germany)
Tateaki Sasaki University of Tsukuba (Japan)
Hiroshi Sekigawa Tokyo University of Science (Japan)
Elias Tsigaridas INRIA Rocquencourt (France)
Nikolay Vassiliev Steklov Institute of Mathematics at St.Petersburg (Russia)
Jan Verschelde University of Illinois at Chicago (USA)
Stephen Watt University of Western Ontario (Canada)
Wenyuan Wu Chongqing Inst. Green and Intelligent Technology (China)
Zhonggang Zeng Northeastern Illinois University (USA)