2021/02/18 by Zhonggang Zeng, Zeng, Zhonggang
Computer Science · Mathematics · #26A18 #47J06 #49M15 #65F22 #65H10 #65J15 #65J20 #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Numerical methods for differential equations #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.2102.09496
openalex publication_date 2021/02/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Singular equations with rank-deficient Jacobians arise frequently in algebraic computing applications. As shown in case studies in this paper, direct and intuitive modeling of algebraic problems often results in nonisolated singular solutions. The challenges become formidable when the problems need to be solved from empirical data of limited accuracy. A newly discovered low-rank Newton's iteration emerges as an effective regularization mechanism that enables solving singular equations accurately with an error bound in the same order as the data error. This paper elaborates applications of new methods on solving singular algebraic equations such as singular linear systems, polynomial GCD and factorizations as well as matrix defective eigenvalue problems.