Zhonggang Zeng  
Bernard J. Brommel Distinguished Research Professor of NEIU
Professor of Mathematics

Office: 218D,
 Science Building,    Phone: (773)442-5763     email: zzeng at neiu dot edu
Office hours:   Monday & Wednesday,          1:15-2:05 and  3:50--4:50  pm  (walk-in, no need to make an appointment)

Current course links:  
[Math 322] [Math 340]

NewNAClab 2017.1:  Numerical Algebraic Computing Toolbox for Matlab 
                                    (updated on Jan. 8, 2017)

Research projects:
supported in part by National Science Foundation under Grant DMS-1620337 
(Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s)
and do not necessarily reflect the views of the National Science Foundation

Software release  ApaTools a software toolbox for approximate polynomial algebra in Maple 

Selected publications:

Computing multiple roots of inexact polynomials,  Mathematics of Computation, 74(2005),  pp 869 - 903
                This work won the Distinguished Paper Award
at ACM ISSAC '03 Conference

          The citation:
             citation                 award       

Algorithm 835: MultRoot -- A Matlab package for computing polynomial roots and multiplicities, 
ACM Transaction on Mathematical Software, 30, pp 218-315, 2004    [Software Package]

NewA numerical analyst's Tubular Neighbrohood Theorem  

NewThe numerical factorization of polynomials   J. of Foundation of Computational Mathematics

 NewSensitivity and computation of a defective eigenvalue     [Resources / Matlab codes]  SIAM  J. Matrix Anal. Appl.

Multiple zeros of nonlinear systems   Mathematics of Computation,  
Regularization and matrix computation in numerical polynomial algebra  
A rank-revealing method with updating, downdating and applicationsPart I  &  Part II
SIAM Journal on Matrix Analysis and Applications
The approximate GCD of inexact polynomials   Part I  Part II 
A numerical elimination method for polynomial computations  Theoretical Computer Science
The closedness subspace method for computing the multiplicity structure of a polynomial system


Other publications

Presentations (click the image to open the file, then keep clicking to see the animation)

       The Tale of Polynomials     Removing Ill-posedness    Approximate GCD