Numerical Algebraic Geometry

Sunday, July 22, 2007, 8:00am-12:30pm

A session of ACA'07
July 19-22, 2007
Oakland University, Rochester, Michigan

Organizers
Overview:   To answer questions posed in algebraic geometry over the complexes, one may take advantage of the continuity of the complex number field to construct homotopy solution algorithms. Numerical algebraic geometry is concerned with the theoretical construction of homotopies, the symbolic processes used in their construction, and the numerical implementation in floating point arithmetic of the solution algorithms. The field also includes symbolic-numeric methods for deflating nonreduced solution components, for approximate factorization, and for numerical calculation of other algebraic-geometric quantities (eigenvalues, algebraic invariants, etc.). The goal of this session is to review such techniques and bring together researchers from this area. 

Schedule (Click author name for abstract)
08:00-08:50Jan Verschelde
An Overview of Numerical Algebraic Geometry
09:00-09:25Zhonggang Zeng
Numerical Computation of the Polynomial Irreducible Factorization
09:30-09:55Gregory Reid
New Extensions and Applications for Numerical Algebraic Geometry
10:00-10:30Break
10:30-10:55Daniel Bates
Numerical Algebraic Geometry in Control Theory
11:00-11:25Barry Dayton
Local Solution of Analytic Systems by Homotopy
11:30-12:00Anton Leykin
Computing Embedded Solution Components via Deflation
12:00-12:30Wenyuan Wu
Fast Prolongation Method for Partial Differential Equations


Applications of Computer Algebra 2007 (ACA'07) main website


Last modified: June 13, 2007