most citedMultiple zeros of nonlinear systems

76 citations · 129 across the 8 of their papers we have counts for

collaborators

9 papers

math.NA2021★ 76 cited

Multiple zeros of nonlinear systems

Barry H. Dayton, Tien-Yien Li, Zhonggang Zeng

As an attempt to bridge between numerical analysis and algebraic geometry, this paper formulates the multiplicity for the general nonlinear system at an isolated zero, presents an…

math.NA2021★ 8 cited

The numerical factorization of polynomials

Wenyuan Wu, Zhonggang Zeng

Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical compu…

math.NA2021★ 25 cited

The numerical greatest common divisor of univariate polynomials

Zhonggang Zeng

This paper presents a regularization theory for numerical computation of polynomial greatest common divisors and a convergence analysis, along with a detailed description of a blac…

math.NA2021★ 11 cited

Sensitivity and computation of a defective eigenvalue

Zhonggang Zeng

A defective eigenvalue is well documented to be hypersensitive to data perturbations and round-off? errors, making it a formidable challenge in numerical computation particularly w…

math.NA2021★ 2 cited

A numerical method for computing the Jordan Canonical Form

Zhonggang Zeng, Tien-Yien Li

The Jordan Canonical Form of a matrix is highly sensitive to perturbations, and its numerical computation remains a formidable challenge. This paper presents a regularization theor…

math.NA2021★ 7 cited

On the sensitivity of singular and ill-Conditioned linear systems

Zhonggang Zeng

Solving a singular linear system for an individual vector solution is an ill-posed problem with a condition number infinity. From an alternative perspective, however, the general s…